Constant-Rank Condition and Second-Order Constraint Qualification
https://purl.org/becyt/ford/1.1
NONLINEAR PROGRAMMING
0101 mathematics
CONSTRAINT QUALIFICATIONS
https://purl.org/becyt/ford/1
01 natural sciences
DOI:
10.1007/s10957-010-9671-8
Publication Date:
2010-02-23T20:07:20Z
AUTHORS (3)
ABSTRACT
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.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (30)
CITATIONS (35)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....