REMARKS ON POTENTIAL VERSUS BARRIER FUNCTION METHODS FOR LINEAR PROGRAMMING
DOI10.15807/JORSJ.34.391zbMATH Open0755.90060OpenAlexW406942964MaRDI QIDQ4018345FDOQ4018345
Authors: Kaoru Tone
Publication date: 16 January 1993
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.34.391
Recommendations
- Rank-one techniques in log-barrier function methods for linear programming
- Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
- Publication:3494376
- Some Convergence Properties of the Modified Log Barrier Method for Linear Programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (6)
- Title not available (Why is that?)
- Some Convergence Properties of the Modified Log Barrier Method for Linear Programming
- Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Title not available (Why is that?)
- Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs
This page was built for publication: REMARKS ON POTENTIAL VERSUS BARRIER FUNCTION METHODS FOR LINEAR PROGRAMMING
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018345)