Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.

DOI10.1007/s10107980020azbMath1050.90571MaRDI QIDQ1572663

Shinji Mizuno, Florian Jarre

Publication date: 21 July 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107980020a

zbMATH Keywords

convergence; interior-point method; linear programming problem; primal-dual; inexact computation

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90C05: Linear programming

90C51: Interior-point methods

Related Items

Unnamed Item, A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods, Interior point methods 25 years later, Convergence analysis of the inexact infeasible interior-point method for linear optimization, Stability and accuracy of inexact interior point methods for convex quadratic programming, An interior point-proximal method of multipliers for convex quadratic programming, An interior point-proximal method of multipliers for linear positive semi-definite programming, Primal-Dual Interior Point Multigrid Method for Topology Optimization, Solving scalarized multi-objective network flow problems using an interior point method

Uses Software

• PDNET