A simple proof of second-order sufficient optimality conditions in nonlinear semidefinite optimization

DOI10.1007/S11590-023-02031-7MaRDI QIDQ6411841zbMATH OpenOpenAlexFDO

Authors P. Mehlitz

Publication date 25 September 2022

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11590-023-02031-7

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Abstract: In this note, we present an elementary proof for a well-known second-order sufficient optimality condition in nonlinear semidefinite optimization which does not rely on the enhanced theory of second-order tangents. Our approach builds on an explicit elementary computation of the so-called second subderivative of the indicator function associated with the semidefinite cone which recovers the best curvature term known in the literature.

Recommendations

• On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
• Elementary optimality conditions for nonlinear SDPs
• First and second order analysis of nonlinear semidefinite programs
• Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
• Optimality conditions for nonconvex semidefinite programming

Cited in

(1)

• Optimality conditions for a class of nonsmooth semidefinite bilevel optimization problems via convexifications applied to bilevel supply chain under uncertainty

This page was built for publication: A simple proof of second-order sufficient optimality conditions in nonlinear semidefinite optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6411841)