Revisiting degeneracy, strict feasibility, stability, in linear programming
From MaRDI portal
Publication:6113350
DOI10.1016/j.ejor.2023.03.021arXiv2203.02795MaRDI QIDQ6113350
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.02795
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal and dual active-set methods for convex quadratic programming
- A note on alternating projections for ill-posed semidefinite feasibility problems
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
- On the solution of highly degenerate linear programmes
- Regularizing the abstract convex program
- Robust solutions of uncertain linear programs
- Degeneracy in interior point methods for linear programming: A survey
- Pivot rules for linear programming: A survey on recent theoretical developments
- Some perturbation theory for linear programming
- Advanced preprocessing techniques for linear and quadratic programming
- Some NP-complete problems in linear programming
- The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling
- Presolving in linear programming
- Rank revealing Gaussian elimination by the maximum volume concept
- How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- A strengthened Barvinok-Pataki bound on SDP rank
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- The Simplex Method for Quadratic Programming
- The central path visits all the vertices of the Klee–Minty cube
- Solving Real-World Linear Programs: A Decade and More of Progress
- A note on degeneracy in linear programming
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- New Finite Pivoting Rules for the Simplex Method
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Error Bounds for Linear Matrix Inequalities
- A Note on Performance Profiles for Benchmarking Software
- On an Extension of Condition Number Theory to Nonconic Convex Optimization
- Optimality and Degeneracy in Linear Programming
- Error Bounds and Singularity Degree in Semidefinite Programming
- Benchmarking optimization software with performance profiles.
