Second-order optimality conditions for nonlinear conic programming
Second-order optimality conditions for nonlinear programming
Sequential optimality conditions for nonlinear symmetric cone programming
![]() | |
Author(s): |
Gabriel Haeser
Total Authors: 1
|
Document type: | Doctoral Thesis |
Press: | Campinas, SP. |
Institution: | Universidade Estadual de Campinas (UNICAMP). Instituto de Matemática, Estatística e Computação Científica |
Defense date: | 2009-04-09 |
Examining board members: |
José Mario Martínez Pérez;
Márcia Aparecida Gomes Ruggiero;
Paulo José da Silva e Silva;
Luis Mauricio Graña Drummond;
Susana Scheimberg de Makler
|
Advisor: | José Mario Martínez Pérez |
Abstract | |
We study optimality conditions generated by the external penalty, internal penalty, internal-external penalty and inexact restoration algorithms, and we show relations with the CPLD, a new constraint qualification strictly weaker than the Mangasarian-Fromovitz condition and the constant rank condition of Janin. We extend the result of the classical Carathéodory's Lemma, where we show a bound for the size of the new multipliers. We present new optimality conditions related to the Approximate Gradient Projection condition (AGP). When there is an extra set of linear constraints, we define an AGP type condition and prove relations with CPLD and KKT conditions. Similar results are obtained when there is an extra set of convex constraints. We provide some further generalizations and relations to an inexact restoration algorithm. (AU) |