Convergence Analysis of Inexact Infeasible-Interior-Point Algorithms for Solving Linear Programming Problems

DOI10.1137/S1052623497329993zbMath0999.90051OpenAlexW2031735948MaRDI QIDQ2706319

J. Korzak

Publication date: 19 March 2001

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623497329993

zbMATH Keywords

linear programminginfeasible-interior-point methodinexact search direction

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items (8)

A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods ⋮ Matrix-free interior point method ⋮ Solving scalarized multi-objective network flow problems using an interior point method ⋮ Convergence analysis of an inexact potential reduction method for convex quadratic programming ⋮ A general class of penalty/barrier path-following Newton methods for nonlinear programming ⋮ Convergence analysis of the inexact infeasible interior-point method for linear optimization ⋮ Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning ⋮ Unnamed Item

This page was built for publication: Convergence Analysis of Inexact Infeasible-Interior-Point Algorithms for Solving Linear Programming Problems