Constant-Rank Condition and Second-Order Constraint Qualification
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 c...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2010 |
| País: | Argentina |
| Recursos: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/193031 |
| Acesso em linha: | http://hdl.handle.net/11336/193031 |
| Access Level: | acceso abierto |
| Palavra-chave: | CONSTRAINT QUALIFICATIONS NONLINEAR PROGRAMMING https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| Resumo: | 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. |
|---|