4 citations · 4 across the 1 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2026
Augmented Lagrangian methods for nonlinear semidefinite programming with complementarity constraints
Daiana O. Santos, Carina M. Costa, Evelin H. M. Krulikovski e Marina Geremia
We consider nonlinear semidefinite programming problems with complementarity constraints (SDCMPCC), a class of highly degenerate problems where classical optimality conditions typi…
math.OC2020★ 4 cited
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-…