On stability of minimizers in convex programming

DOI10.1016/J.NA.2011.03.033MaRDI QIDQ654097zbMATH OpenOpenAlexFDO

Authors Ilya Shvartsman

Publication date 21 December 2011

Published in Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.na.2011.03.033

zbMATH Keywords

Hölder and Lipschitz continuityregularity

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)

Cites work

• A sufficient condition for continuity of optimal sets in mathematical programming
• An implicit function theorem: Comment
• scientific article; zbMATH DE number 50640 (Why is no real title available?)
• scientific article; zbMATH DE number 1099075 (Why is no real title available?)
• scientific article; zbMATH DE number 1099081 (Why is no real title available?)
• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• scientific article; zbMATH DE number 3308659 (Why is no real title available?)
• Lipschitz Continuity for Constrained Processes
• Strongly Regular Generalized Equations
• Variational Analysis

Cited in

(4)

• Convergence for stabilisation of degenerately convex minimisation problems
• scientific article; zbMATH DE number 5360842 (Why is no real title available?)
• scientific article; zbMATH DE number 4074834 (Why is no real title available?)
• Precise Stability Phase Transitions for \ell₁ Minimization: A Unified Geometric Framework

This page was built for publication: On stability of minimizers in convex programming

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