Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables

DOI10.1287/MOOR.20.2.415zbMATH Open0837.90083OpenAlexW2159588260MaRDI QIDQ4848422FDOQ4848422

Authors: Robert M. Freund, Michael J. Todd 

Publication date: 17 September 1995

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.20.2.415

Recommendations

• scientific article; zbMATH DE number 653032
• Primal-dual methods for linear programming
• REMARKS ON POTENTIAL VERSUS BARRIER FUNCTION METHODS FOR LINEAR PROGRAMMING
• Primal-dual algorithms for linear programming based on the logarithmic barrier method
• Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method

zbMATH Keywords

barrier functionspath-following and potential-reduction interior-point algorithms

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (7)

• Scaling, shifting and weighting in interior-point methods
• Barrier Functions in Interior Point Methods
• Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
• Title not available (Why is that?)
• On the New Barrier Function and Specialized Algorithms for a Class of Semidefinite Programs
• Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs
• New self-concordant barrier for the hypercube

This page was built for publication: Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4848422)