New trajectory-following polynomial-time algorithm for linear programming problems

DOI10.1007/BF00939806zbMATH Open0662.90047MaRDI QIDQ1114587FDOQ1114587

Authors: C. Roos 

Publication date: 1989

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Recommendations

• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A primal projective interior point method for linear programming
• scientific article; zbMATH DE number 938987
• Interior path following primal-dual algorithms. I: Linear programming

zbMATH Keywords

interior point methodpath following methodspolynomial time bound

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• A new polynomial-time algorithm for linear programming
• Title not available (Why is that?)
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• An implementation of Karmarkar's algorithm for linear programming
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• Title not available (Why is that?)
• Title not available (Why is that?)
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A multiplicative barrier function method for linear programming
• A modification of Karmarkar's linear programming algorithm
• The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
• On the convexity of the multiplicative version of Karmarkar's potential function
• Karmarkar's linear programming algorithm and Newton's method
• Search directions for interior linear-programming methods

Cited In (12)

• Title not available (Why is that?)
• A polynomial method of approximate centers for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm
• Algorithmic Enhancements to the Method of Centers for Linear Programming Problems
• Volumetric path following algorithms for linear programming
• New interior point algorithms in linear programming
• An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
• On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
• Analysis of some interior point continuous trajectories for convex programming
• A Polynomial Method of Weighted Centers for Convex Quadratic Programming
• A survey of search directions in interior point methods for linear programming

This page was built for publication: New trajectory-following polynomial-time algorithm for linear programming problems

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