Some Convergence Properties of the Modified Log Barrier Method for Linear Programming
From MaRDI portal
DOI10.1137/0805035zbMATH Open0841.65046OpenAlexW2007094954MaRDI QIDQ4862780FDOQ4862780
Authors: 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
Recommendations
- scientific article; zbMATH DE number 776089
- One modification of the logarithmic barrier function method in linear and convex programming
- The convergence of a modified barrier method for convex programming
- REMARKS ON POTENTIAL VERSUS BARRIER FUNCTION METHODS FOR LINEAR PROGRAMMING
- A logarithmic barrier approach for linear programming
Cited In (14)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The convergence of an interior-point method using modified search directions in final iterations
- One modification of the logarithmic barrier function method in linear and convex programming
- Dual convergence of the proximal point method with Bregman distances for linear programming
- The Legendre transformation in modern optimization
- Title not available (Why is that?)
- On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization
- On controlling the parameter in the logarithmic barrier term for convex programming problems
- A build-up variant of the logarithmic barrier method for LP
- REMARKS ON POTENTIAL VERSUS BARRIER FUNCTION METHODS FOR LINEAR PROGRAMMING
- The convergence of a modified barrier method for convex programming
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Some Convergence Properties of the Modified Log Barrier Method for Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862780)
