Convergence analysis of the inexact infeasible interior-point method for linear optimization
From MaRDI portal
Publication:1028608
DOI10.1007/s10957-008-9500-5zbMath1176.90647MaRDI QIDQ1028608
Publication date: 6 July 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://www.maths.ed.ac.uk/~gondzio/REF/alJeiroudiGondzioJOTA.pdf
90C06: Large-scale problems in mathematical programming
90C05: Linear programming
90C51: Interior-point methods
Related Items
Matrix-free interior point method, Interior point methods 25 years later, Local path-following property of inexact interior methods in nonlinear programming, Stability and accuracy of inexact interior point methods for convex quadratic programming, Null-Space Preconditioners for Saddle Point Systems
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
- Inexact interior-point method
- Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
- Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Convergence analysis of an inexact infeasible interior point method for semidefinite programming
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- Convergence Analysis of Inexact Infeasible-Interior-Point Algorithms for Solving Linear Programming Problems
- Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs
- 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
- Inexact Newton Methods
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming
- Large-Scale Scientific Computing
