Conditioning for optimization problems under general perturbations

DOI10.1016/j.na.2011.07.061zbMath1225.90132OpenAlexW2016985943MaRDI QIDQ644175

Rita Pini, Gábor Kassay, Monica Bianchi

Publication date: 3 November 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.07.061

zbMATH Keywords

sensitivityconvex optimizationcondition number theorem

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31)

Related Items (4)

An inverse map result and some applications to sensitivity of generalized equations ⋮ On condition number theorems in mathematical programming ⋮ A condition number theorem in convex programming ⋮ Unnamed Item

Cites Work

• Well-posed optimization problems
• Convexity and well-posed problems
• Robinson's implicit function theorem and its extensions
• Linear programming, complexity theory and elementary functional analysis
• Tilt Stability of a Local Minimum
• Condition Number Theorems in Optimization
• Multivalued parametric variational inequalities with \(\alpha\)-pseudomonotone maps
• Unnamed Item
• Unnamed Item

This page was built for publication: Conditioning for optimization problems under general perturbations