A stable primal-dual approach for linear programming under nondegeneracy assumptions
From MaRDI portal
(Redirected from Publication:849092)
Recommendations
Cites work
- scientific article; zbMATH DE number 992799 (Why is no real title available?)
- scientific article; zbMATH DE number 46305 (Why is no real title available?)
- scientific article; zbMATH DE number 3546670 (Why is no real title available?)
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 852532 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- scientific article; zbMATH DE number 3052543 (Why is no real title available?)
- A QMR-based interior-point algorithm for solving linear programs
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- A primal-dual interior-point algorithm for quadratic programming
- A study of preconditioners for network interior point methods
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- Combining Interior-Point and Pivoting Algorithms for Linear Programming
- Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
- Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- Computational experience with rigorous error bounds for the Netlib linear programming library
- Condition numbers and equilibration of matrices
- Degeneracy in interior point methods for linear programming: A survey
- Error bounds in mathematical programming
- Exposing Constraints
- Finding an interior point in the optimal face of linear programs
- Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
- Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods
- Iterative Solution of Linear Programs
- LOQO:an interior point code for quadratic programming
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Linear Programming in O([n3/ln n]L) Operations
- Linear programming. Foundations and extensions
- Modifying SQP for Degenerate Problems
- Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
- On the Identification of Active Constraints
- On the Identification of Active Constraints II: The Nonconvex Case
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- Preconditioning indefinite systems in interior point methods for optimization
- Robust convex optimization
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust solutions of uncertain linear programs
- Sizing and Least-Change Secant Methods
- Solving semidefinite programs using preconditioned conjugate gradients
- Sparse QR factorization in MATLAB
- Stability of Augmented System Factorizations in Interior-Point Methods
- Stability of Linear Equations Solvers in Interior-Point Methods
- The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
- User'S guide To Lipsol linear-programming interior point solvers V0.4
Cited in
(12)- Primal-dual path-following methods and the trust-region updating strategy for linear programming with noisy data
- Sparsity preserving preconditioners for linear systems in interior-point methods
- A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
- Constraint identification and algorithm stabilization for degenerate nonlinear programs
- Stability of Linear Equations Solvers in Interior-Point Methods
- Primal-dual stability in continuous linear optimization
- Stabilization of Mehrotra's primal-dual algorithm and its implementation
- A robust algorithm for semidefinite programming
- A note on primal-dual stability in infinite linear programming
- Revisiting degeneracy, strict feasibility, stability, in linear programming
- Stability of the primal-dual partition in linear semi-infinite programming
- Strong duality and minimal representations for cone optimization
This page was built for publication: A stable primal-dual approach for linear programming under nondegeneracy assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q849092)
