4 citations · 10 across the 7 of their papers we have counts for
7 papers
Exploiting cone approximations in an augmented Lagrangian method for conic optimization
Mituhiro Fukuda, Walter Gómez, Gabriel Haeser +1
We propose an algorithm for general nonlinear conic programming which does not require the knowledge of the full cone, but rather a simpler, more tractable, approximation of it. We…
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…
On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
Ellen H. Fukuda, Gabriel Haeser, Leonardo M. Mito
Second-order necessary optimality conditions for nonlinear conic programming problems that depend on a single Lagrange multiplier are usually built under nondegeneracy and strict c…
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…