Some Convergence Properties of the Modified Log Barrier Method for Linear Programming
From MaRDI portal
Publication:4862780
DOI10.1137/0805035zbMath0841.65046MaRDI QIDQ4862780
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
convergence; linear programming; interior point methods; Karush-Kuhn-Tucker conditions; log barrier method
Related Items
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, The Legendre Transformation in Modern Optimization