| Full text | |
| Author(s): |
Andreani, Roberto
;
Haeser, Gabriel
;
Mito, Leonardo M.
;
Ramirez, Hector
Total Authors: 4
|
| Document type: | Journal article |
| Source: | Set-Valued and Variational Analysis; v. 31, n. 1, p. 27-pg., 2023-03-01. |
| Abstract | |
We present new constraint qualification conditions for nonlinear semidefinite programming that extend some of the constant rank-type conditions from nonlinear programming. As an application of these conditions, we provide a unified global convergence proof of a class of algorithms to stationary points without assuming neither uniqueness of the Lagrange multiplier nor boundedness of the Lagrange multipliers set. This class of algorithms includes, for instance, general forms of augmented Lagrangian, sequential quadratic programming, and interior point methods. In particular, we do not assume boundedness of the dual sequence generated by the algorithm. The weaker sequential condition we present is shown to be strictly weaker than Robinson's condition while still implying metric subregularity. (AU) | |
| FAPESP's process: | 17/18308-2 - Second-order optimality conditions and algorithms |
| Grantee: | Gabriel Haeser |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 18/24293-0 - Computational methods in optimization |
| Grantee: | Sandra Augusta Santos |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 17/17840-2 - Error estimation in nonlinear optimization |
| Grantee: | Leonardo Makoto Mito |
| Support Opportunities: | Scholarships in Brazil - Doctorate |