Conditioning of Convex Programs from a Primal-Dual Perspective

DOI10.1287/moor.26.2.206.10551zbMath1082.90557OpenAlexW2040628068MaRDI QIDQ5704034

Javier F. Peña

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.26.2.206.10551

zbMATH Keywords

condition numberConvex programming

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Interior-point methods (90C51)

Related Items (5)

Extreme points of well-posed polytopes ⋮ Stability under perturbations of some condition numbers in optimization ⋮ Weak sharp efficiency and growth condition for vector-valued functions with applications ⋮ Condition Number Theorems in Linear-Quadratic Optimization ⋮ Metric regularity of semi-infinite constraint systems

This page was built for publication: Conditioning of Convex Programs from a Primal-Dual Perspective