Characterizations of tilt-stable minimizers in second-order cone programming

From MaRDI portal
Publication:5206940

DOI10.1137/18M1213117zbMATH Open1434.90191arXiv1809.03607OpenAlexW2996296375WikidataQ126577956 ScholiaQ126577956MaRDI QIDQ5206940FDOQ5206940


Authors: Matus Benko, Helmut Gfrerer, Boris S. Mordukhovich Edit this on Wikidata


Publication date: 19 December 2019

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Abstract: This paper is devoted to the study of tilt stability of local minimizers, which plays an important role in both theoretical and numerical aspects of optimization. This notion has been comprehensively investigated in the unconstrained framework as well as for problems of nonlinear programming with C2-smooth data. Available results for nonpolyhedral conic programs were obtained only under strong constraint nondegeneracy assumptions. Here we develop an approach of second-order variational analysis, which allows us to establish complete neighborhood and pointbased characterizations of tilt stability for problems of second-order cone programming generated by the nonpolyhedral second-order/Lorentz/ice-cream cone. These characterizations are established under the weakest metric subregularity constraint qualification condition.


Full work available at URL: https://arxiv.org/abs/1809.03607




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Characterizations of tilt-stable minimizers in second-order cone programming

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