Large step volumetric potential reduction algorithms for linear programming

DOI10.1007/BF02206828zbMath0848.90080MaRDI QIDQ1915924

Kurt M. Anstreicher

Publication date: 1 July 1996

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

zbMATH Keywords

potential reduction algorithmsinterior algorithmmixed volumetric-logarithmic, barrier function algorithms

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Related Items (3)

Volumetric path following algorithms for linear programming ⋮ Relatively Smooth Convex Optimization by First-Order Methods, and Applications ⋮ Interior Point Methods for Nonlinear Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
• Polynomial affine algorithms for linear programming
• A new algorithm for minimizing convex functions over convex sets
• Matrix Analysis
• Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
• Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method

This page was built for publication: Large step volumetric potential reduction algorithms for linear programming