Advanced search
Start date
Betweenand


On the Weak Second-order Optimality Condition for Nonlinear Semidefinite and Second-order Cone Programming

Full text
Author(s):
Fukuda, Ellen H. ; Haeser, Gabriel ; Mito, Leonardo M.
Total Authors: 3
Document type: Journal article
Source: Set-Valued and Variational Analysis; v. 31, n. 2, p. 28-pg., 2023-06-01.
Abstract

Second-order necessary optimality conditions for nonlinear conic programming problems that depend on a single Lagrange multiplier are usually built under nondegeneracy and strict complementarity. In this paper we establish a condition of such type for two classes of nonlinear conic problems, namely semidefinite and second-order cone programming, assuming Robinson's constraint qualification and a weak constant rank-type property which are, together, strictly weaker than nondegeneracy. Our approach is done via a penalty-based strategy, which is aimed at providing strong global convergence results for first- and second-order algorithms. Since we are not assuming strict complementarity, the critical cone does not reduce to a subspace, thus, the second-order condition we arrive at is defined in terms of the lineality space of the critical cone. In the case of nonlinear programming, this condition reduces to the standard second-order condition widely used as second-order stationarity measure in the algorithmic practice. (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