On an Extension of Condition Number Theory to Nonconic Convex Optimization

DOI10.1287/moor.1040.0120zbMath1082.90151OpenAlexW2238965178MaRDI QIDQ5704217

Robert M. Freund, Fernando Ordóñez

Publication date: 11 November 2005

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

Full work available at URL: http://hdl.handle.net/1721.1/1833

zbMATH Keywords

convex optimizationperturbation theorysensitivity analysisdualitycondition numberconic optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (4)

Revisiting degeneracy, strict feasibility, stability, in linear programming ⋮ Robust optimization with applications to game theory ⋮ The Condition Number of Riemannian Approximation Problems ⋮ Probabilistic analysis of the Grassmann condition number

This page was built for publication: On an Extension of Condition Number Theory to Nonconic Convex Optimization