Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
From MaRDI portal
Publication:2643618
DOI10.1007/s10589-006-9006-8zbMath1148.90352MaRDI QIDQ2643618
Publication date: 27 August 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/7410
Related Items
An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming, Hopfield neural networks in large-scale linear optimization problems, Interior point methods 25 years later, Sparsity preserving preconditioners for linear systems in interior-point methods, Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming, Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods, A stable primal-dual approach for linear programming under nondegeneracy assumptions, Convergence analysis of the inexact infeasible interior-point method for linear optimization, Improving the preconditioning of linear systems from interior point methods, Using groups in the splitting preconditioner computation for interior point methods, A specialized primal-dual interior point method for the plastic truss layout optimization, A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods, Block preconditioners for linear systems in interior point methods for convex constrained optimization, A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming, An inexact interior-point method for system analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- Solving symmetric indefinite systems in an interior-point method for linear programming
- A QMR-based interior-point algorithm for solving linear programs
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Preconditioning indefinite systems in interior point methods for optimization
- A Note on Preconditioning Nonsymmetric Matrices
- Block preconditioners for symmetric indefinite linear systems
- Preconditioners for Indefinite Systems Arising in Optimization
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- User'S guide To Lipsol linear-programming interior point solvers V0.4
- PCx: an interior-point code for linear programming
- Constraint Preconditioning for Indefinite Linear Systems
- A Note on Preconditioning for Indefinite Linear Systems
- Symmetric Quasidefinite Matrices
- Preconditioning methods for linear systems arising in constrained optimization problems
