Volumetric path following algorithms for linear programming

DOI10.1007/BF02614386zbMATH Open0881.90092MaRDI QIDQ1361113FDOQ1361113

Authors: Kurt M. Anstreicher 

Publication date: 19 February 1998

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

Recommendations

• Path-Following Methods for Linear Programming
• Mixed volume computation via linear programming
• A maximal volume cone algorithm for linear programming problems
• A path following algorithm for a class of convex programming problems
• Weighted-path-following algorithm for linear programming
• A path-following version of the Todd-Burrell procedure for linear programming
• On the generalized path-following methods for linear programming
• scientific article; zbMATH DE number 1855673
• Large step volumetric potential reduction algorithms for linear programming
• New trajectory-following polynomial-time algorithm for linear programming problems

zbMATH Keywords

quadratic convergencemixed volumetric-logarithmic barrierssmall step path following algorithms

Mathematics Subject Classification ID

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

Cites Work

• Matrix Analysis
• Title not available (Why is that?)
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A new algorithm for minimizing convex functions over convex sets
• Path-Following Methods for Linear Programming
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• A polynomial method of approximate centers for linear programming
• Large step volumetric potential reduction algorithms for linear programming
• A technique for bounding the number of iterations in path following algorithms

Cited In (5)

• On the volumetric path
• A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming
• A class of volumetric barrier decomposition algorithms for stochastic quadratic programming
• Interior Point Methods for Nonlinear Optimization
• The volumetric barrier for semidefinite programming.

This page was built for publication: Volumetric path following algorithms for linear programming

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