Volumetric path following algorithms for linear programming

DOI10.1007/BF02614386zbMath0881.90092MaRDI QIDQ1361113

Kurt M. Anstreicher

Publication date: 19 February 1998

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

quadratic convergencemixed volumetric-logarithmic barrierssmall step path following algorithms

Mathematics Subject Classification ID

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

Related Items

A class of volumetric barrier decomposition algorithms for stochastic quadratic programming ⋮ A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming ⋮ Interior Point Methods for Nonlinear Optimization

Cites Work

• A polynomial-time algorithm, based on Newton's method, for linear programming
• A polynomial method of approximate centers for linear programming
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• Large step volumetric potential reduction algorithms for linear programming
• A new algorithm for minimizing convex functions over convex sets
• Matrix Analysis
• Path-Following Methods for Linear Programming
• Unnamed Item
• Unnamed Item