Abstract
AbstractIn 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.
Funder
Brandenburgische TU Cottbus-Senftenberg
Publisher
Springer Science and Business Media LLC
Subject
Control and Optimization,Business, Management and Accounting (miscellaneous)
Reference35 articles.
1. Ben-Tal, A.: Second-order and related extremality conditions in nonlinear programming. J. Optimizat. Theory Appl. 31(2), 143–165 (1980). https://doi.org/10.1007/BF00934107
2. Benko, M., Mehlitz, P.: Why second-order sufficient conditions are, in a way, easy – or – revisiting calculus for second subderivatives. Journal of Convex Analysis https://arxiv.org/abs/2206.03918, in press (2023)
3. Benko, M., Gfrerer, H., Ye, J.J., Zhang, J., Zhou, J.: Second-order optimality conditions for general nonconvex optimization problems and variational analysis of disjunctive systems. preprint arXiv https://arxiv.org/abs/2203.10015 (2022)
4. Bomze, I.M.: Copositive optimization–recent developments and applications. Eur. J. Operat. Res. 216(3), 509–520 (2012). https://doi.org/10.1016/j.ejor.2011.04.026
5. Bonnans, J.F., Ramírez, C.H.: Perturbation analysis of second-order cone programming problems. Math. Program. 104, 205–227 (2005). https://doi.org/10.1007/s10107-005-0613-4