João Xavier da Cruz Neto
Orcid: 0000-0001-7489-6303
According to our database1,
João Xavier da Cruz Neto
authored at least 34 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
J. Glob. Optim., December, 2024
J. Optim. Theory Appl., January, 2024
On the Relationship Between the Kurdyka-Łojasiewicz Property and Error Bounds on Hadamard Manifolds.
J. Optim. Theory Appl., 2024
2022
J. Optim. Theory Appl., 2022
Ann. Oper. Res., 2022
A new regularization of equilibrium problems on Hadamard manifolds: applications to theories of desires.
Ann. Oper. Res., 2022
Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm.
Ann. Oper. Res., 2022
2020
A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems.
Comput. Optim. Appl., 2020
Comput. Optim. Appl., 2020
A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem.
Ann. Oper. Res., 2020
2019
Optim. Lett., 2019
J. Optim. Theory Appl., 2019
2018
The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem.
SIAM J. Optim., 2018
Optim. Lett., 2018
Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization of Hadamard Manifolds.
J. Optim. Theory Appl., 2018
2017
Eur. J. Oper. Res., 2017
2016
SIAM J. Optim., 2016
Optim. Lett., 2016
A New Approach to the Proximal Point Method: Convergence on General Riemannian Manifolds.
J. Optim. Theory Appl., 2016
2014
J. Optim. Theory Appl., 2014
The self regulation problem as an inexact steepest descent method for multicriteria optimization.
Eur. J. Oper. Res., 2014
2013
An Inexact Steepest Descent Method for Multicriteria Optimization on Riemannian Manifolds.
J. Optim. Theory Appl., 2013
J. Optim. Theory Appl., 2013
2012
Interior Proximal Algorithm for Quasiconvex Programming Problems and Variational Inequalities with Linear Constraints.
J. Optim. Theory Appl., 2012
2011
2010
A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant.
Eur. J. Oper. Res., 2010
2007
Dual convergence of the proximal point method with Bregman distances for linear programming.
Optim. Methods Softw., 2007
2006
Convex- and Monotone-Transformable Mathematical Programming Problems and a Proximal-Like Point Method.
J. Glob. Optim., 2006
2005
Asymptotic behavior of the central path for a special class of degenerate SDP problems.
Math. Program., 2005