Large step volumetric potential reduction algorithms for linear programming

DOI10.1007/BF02206828MaRDI QIDQ1915924zbMATH OpenFDO

Authors Kurt M. Anstreicher

Publication date 1 July 1996

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

Full work available at URL https://doi.org/10.1007/BF02206828

zbMATH Keywords

potential reduction algorithmsinterior algorithmmixed volumetric-logarithmic, barrier function algorithms

Mathematics Subject Classification ID

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

Recommendations

• Volumetric path following algorithms for linear programming
• Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
• Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• Potential-reduction methods in mathematical programming

Cites work

• scientific article; zbMATH DE number 4167847 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A new algorithm for minimizing convex functions over convex sets
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A technique for bounding the number of iterations in path following algorithms
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• 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
• Matrix Analysis
• Polynomial affine algorithms for linear programming
• Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function

Cited in

(5)

• Relatively smooth convex optimization by first-order methods, and applications
• Interior Point Methods for Nonlinear Optimization
• The volume algorithm: Producing primal solutions with a subgradient method
• Volumetric path following algorithms for linear programming
• 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

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