On condition number theorems in mathematical programming
From MaRDI portal
Publication:1695809
DOI10.1007/s10957-017-1191-3zbMath1387.90193OpenAlexW2768778565MaRDI QIDQ1695809
Publication date: 8 February 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-017-1191-3
condition numbercondition number theoremmathematical programming problems with canonical perturbations
Convex programming (90C25) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)
Related Items (3)
Unnamed Item ⋮ A Data-Independent Distance to Infeasibility for Linear Conic Systems ⋮ Best approximation and optimization
Cites Work
- Conditioning for optimization problems under general perturbations
- Some perturbation theory for linear programming
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Linear programming, complexity theory and elementary functional analysis
- An inverse map result and some applications to sensitivity of generalized equations
- Some results on condition numbers in convex multiobjective optimization
- A condition number theorem in convex programming
- Condition
- Condition Number Theorems in Linear-Quadratic Optimization
- Implicit Functions and Solution Mappings
- Lipschitz Continuity for Constrained Processes
- Complete Characterization of Openness, Metric Regularity, and Lipschitzian Properties of Multifunctions
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Variational Analysis
- Condition Number Theorems in Optimization
- A Coordinate-Free Condition Number for Convex Programming
- Unnamed Item
- Unnamed Item
This page was built for publication: On condition number theorems in mathematical programming
