Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
From MaRDI portal
Publication:2322556
DOI10.1007/s10589-019-00103-yzbMath1427.90289arXiv1604.07491OpenAlexW3104041548MaRDI QIDQ2322556
Yiran Cui, Keiichi Morikuni, Takashi Tsuchiya, Ken Hayami
Publication date: 4 September 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.07491
interior-point methodsKrylov subspace methodslinear programming problemsinner-iteration preconditioning
Related Items
A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods, An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming, Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems, Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning, Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems, An ADMM-based interior-point method for large-scale linear programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Matrix-free interior point method
- Interior point methods 25 years later
- Greville's method for preconditioning least squares problems
- Convergence analysis of the inexact infeasible interior-point method for linear optimization
- Interior path following primal-dual algorithms. I: Linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- Computational results of an interior point algorithm for large scale linear programming
- An interior point method for quadratic programs based on conjugate projected gradients
- 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
- Multiple centrality corrections in a primal-dual method for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- A study of preconditioners for network interior point methods
- Preconditioning indefinite systems in interior point methods for optimization
- Presolving in linear programming
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- Inexact constraint preconditioners for linear systems arising in interior point methods
- Convergence Analysis of Inexact Infeasible-Interior-Point Algorithms for Solving Linear Programming Problems
- Atomic Decomposition by Basis Pursuit
- Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs
- The university of Florida sparse matrix collection
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Graph Implementations for Nonsmooth Convex Programs
- GMRES Methods for Least Squares Problems
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods
- Solution of Sparse Indefinite Systems of Linear Equations
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Interior-Point Methods for Massive Support Vector Machines
- PCx: an interior-point code for linear programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods
- Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming
- Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems
- Inner-Iteration Krylov Subspace Methods for Least Squares Problems
- Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- The Convergence of Linear Stationary Iterative Processes for Solving Singular Unstructured Systems of Linear Equations
- Methods of conjugate gradients for solving linear systems
- The N‐Step Iteration Procedures
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
- Benchmarking optimization software with performance profiles.
