most citedNaive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming

4 citations · 4 across the 1 of their papers we have counts for

collaborators

1 paper

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-…