7 citations · 29 across the 17 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.OC2020★ 2 cited
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…
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-…