Characterizations of Tilt-Stable Minimizers in Second-Order Cone Programming
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 -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.
Cite
@article{arxiv.1809.03607,
title = {Characterizations of Tilt-Stable Minimizers in Second-Order Cone Programming},
author = {Matúš Benko and Helmut Gfrerer and Boris S. Mordukhovich},
journal= {arXiv preprint arXiv:1809.03607},
year = {2018}
}