Condition Number Theorems in Linear-Quadratic Optimization

DOI10.1080/01630563.2011.594369zbMath1232.49030OpenAlexW1997449798MaRDI QIDQ3114598

Tullio Zolezzi

Publication date: 19 February 2012

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2011.594369

zbMATH Keywords

linear-quadratic optimizationcondition numberscondition number theoremleast squares solutions

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Linear-quadratic optimal control problems (49N10)

Related Items

On condition number theorems in mathematical programming ⋮ A condition number theorem in convex programming ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Condition numbers and error bounds in convex programming
• Stability under perturbations of some condition numbers in optimization
• On condition numbers and the distance to the nearest ill-posed problem
• The geometry of ill-conditioning
• Approximation by invertible and noninvertible operators
• Some perturbation theory for linear programming
• Ill-Conditioned Convex Processes and Conic Linear Systems
• Condition Number Theorems in Optimization
• Incorporating Condition Measures into the Complexity Theory of Linear Programming
• Conditioning of Convex Programs from a Primal-Dual Perspective
• Unifying Condition Numbers for Linear Programming