On condition number theorems in mathematical programming
DOI10.1007/S10957-017-1191-3zbMATH Open1387.90193OpenAlexW2768778565MaRDI QIDQ1695809FDOQ1695809
Authors: Tullio Zolezzi 
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
Recommendations
condition numbercondition number theoremmathematical programming problems with canonical perturbations
Convex programming (90C25) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Variational Analysis
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Condition. The geometry of numerical algorithms
- Implicit Functions and Solution Mappings
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Some perturbation theory for linear programming
- Lipschitz Continuity for Constrained Processes
- Complete Characterization of Openness, Metric Regularity, and Lipschitzian Properties of Multifunctions
- A coordinate-free condition number for convex programming
- Linear programming, complexity theory and elementary functional analysis
- An inverse map result and some applications to sensitivity of generalized equations
- Condition Number Theorems in Optimization
- Title not available (Why is that?)
- Conditioning for optimization problems under general perturbations
- Condition number theorems in linear-quadratic optimization
- Some results on condition numbers in convex multiobjective optimization
- A condition number theorem in convex programming
- A condition number theorem in convex programming without uniqueness
Cited In (14)
- A condition number theorem in convex programming
- Stability under perturbations of some condition numbers in optimization
- Title not available (Why is that?)
- A note on level-2 condition numbers
- The condition number of a function relative to a set
- A data-independent distance to infeasibility for linear conic systems
- Unifying Condition Numbers for Linear Programming
- A partial condition number theorem in mathematical programming
- Best approximation and optimization
- Condition number theorems in linear-quadratic optimization
- On an Extension of Condition Number Theory to Nonconic Convex Optimization
- A condition number theorem in convex programming without uniqueness
- Some results on condition numbers in convex multiobjective optimization
- Title not available (Why is that?)
This page was built for publication: On condition number theorems in mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1695809)
