Extreme points of well-posed polytopes
From MaRDI portal
Publication:3446581
DOI10.1080/02331930600662906zbMath1124.90050OpenAlexW2018867016MaRDI QIDQ3446581
Publication date: 19 June 2007
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930600662906
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Linear operators and ill-posed problems, regularization (47A52)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A stable theorem of the alternative: An extension of the Gordan theorem
- Some perturbation theory for linear programming
- Computing approximate solutions for convex conic systems of constraints
- Conditioning of semidefinite programs
- An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard
- Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
- Condition-Measure Bounds on the Behavior of the Central Trajectory of a Semidefinite Program
- A Mathematical View of Interior-Point Methods in Convex Optimization
- A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine
- Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis
- Stability conditions for linear programming problems
- The Tolerance Approach to Sensitivity Analysis in Linear Programming
- Rim Multiparametric Linear Programming
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- A Characterization of Stability in Linear Programming
- Optimization Problems with Perturbations: A Guided Tour
- Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
- Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
- On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data
- On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method
- The Tolerance Approach to Sensitivity Analysis of Matrix Coefficients in Linear Programming
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
- Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
- Conditioning of Convex Programs from a Primal-Dual Perspective
- On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
- An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
- A characterization of ill-posed data instances for convex programming.
This page was built for publication: Extreme points of well-posed polytopes
