8 citations · 22 across the 10 of their papers we have counts for
9 papers · 1 filter
Constraint qualifications and strong global convergence properties of an augmented Lagrangian method on Riemannian manifolds
Roberto Andreani, Kelvin Rodrigues Couto, Orizon Pereira Ferreira +1
In the past years, augmented Lagrangian methods have been successfully applied to several classes of non-convex optimization problems, inspiring new developments in both theory and…
A minimal face constant rank constraint qualification for reducible conic programming
Roberto Andreani, Gabriel Haeser, Leonardo M. Mito +1
In a previous paper [R. Andreani, G. Haeser, L. M. Mito, H. Ramírez, T. P. Silveira. First- and second-order optimality conditions for second-order cone and semidefinite programmin…
Global Convergence of Algorithms Under Constant Rank Conditions for Nonlinear Second-Order Cone Programming
Roberto Andreani, Gabriel Haeser, Héctor Ramírez C. +2
In [R. Andreani, G. Haeser, L. M. Mito, H. Ramírez C., Weak notions of nondegeneracy in nonlinear semidefinite programming, arXiv:2012.14810, 2020] the classical notion of nondegen…
First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition
Roberto Andreani, Gabriel Haeser, Leonardo M. Mito +2
The well known constant rank constraint qualification [Math. Program. Study 21:110--126, 1984] introduced by Janin for nonlinear programming has been recently extended to a conic c…
Sequential constant rank constraint qualifications for nonlinear semidefinite programming with applications
Roberto Andreani, Gabriel Haeser, Leonardo M. Mito +1
We present new constraint qualification conditions for nonlinear semidefinite programming that extend some of the constant rank-type conditions from nonlinear programming. As an ap…
Weak notions of nondegeneracy in nonlinear semidefinite programming
Roberto Andreani, Gabriel Haeser, Leonardo M. Mito +1
The constraint nondegeneracy condition is one of the most relevant and useful constraint qualifications in nonlinear semidefinite programming. It can be characterized in terms of a…
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
R. Andreani, G. Haeser, L. M. Mito +3
The constant rank constraint qualification, introduced by Janin in 1984 for nonlinear programming, has been extensively used for sensitivity analysis, global convergence of first-…
Using first-order information in Direct Multisearch for multiobjective optimization
R. Andreani, A. L. Custódio, M. Raydan
Derivatives are an important tool for single-objective optimization. In fact, it is commonly accepted that derivative-based methods present a better performance than derivative-fre…
On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
V. S. Amaral, R. Andreani, E. G. Birgin +2
Coordinate descent methods have considerable impact in global optimization because global (or, at least, almost global) minimization is affordable for low-dimensional problems. Coo…