Some Convergence Properties of the Modified Log Barrier Method for Linear Programming

DOI10.1137/0805035zbMath0841.65046OpenAlexW2007094954MaRDI QIDQ4862780

M. J. D. Powell

Publication date: 1 July 1996

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

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

zbMATH Keywords

convergencelinear programminginterior point methodsKarush-Kuhn-Tucker conditionslog barrier method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (3)

The Legendre Transformation in Modern Optimization ⋮ Dual convergence of the proximal point method with Bregman distances for linear programming ⋮ On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization

This page was built for publication: Some Convergence Properties of the Modified Log Barrier Method for Linear Programming