Constant-Rank Condition and Second-Order Constraint Qualification

By Roberto Andreani, C. E. Echagüe, María Laura Schuverdt. 2010

68 citations recorded by the source corpus.

The constant-rank condition for feasible points of nonlinear programming problems was defined by Janin (Math. Program. Study 21:127–138, 1984). In that paper, the author proved that the constant-rank condition is a first-order constraint qualification. In this work, we prove that the constant-rank condition is also a second-order constraint qualification. We define other second-order constraint qualifications.

Subfields: Computational Theory and Mathematics, Management Science and Operations Research, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/e83d99bfaa7d6475f26208da16b8d2bdb60d9462

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Jong-Shi Pang
2. Masao Fukushima
3. Dang Van Hieu
4. Yura Malitsky
5. Katsunori Kubota
6. Aviv Gibali
7. Angelia Nedić

In Management Science and Operations Research

1. Jong-Shi Pang

In Numerical Analysis

1. Jong-Shi Pang
2. Dang Van Hieu
3. Masao Fukushima
4. Yura Malitsky
5. Aviv Gibali
6. Angelia Nedić

Citations in the corpus

• Complementarity Formulations of ' 0 -norm Optimization Problems (2013, background): “It is proved in [1] that if the CRCQ holds then any local minimizer must satisfy the second order necessary conditions.”