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

DOI10.1007/s10107980020azbMath1050.90571OpenAlexW1237127655MaRDI 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

convergenceinterior-point methodlinear programming problemprimal-dualinexact computation

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Interior-point methods (90C51)

Related Items

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

Uses Software

• PDNET