Search directions for interior linear-programming methods

DOI10.1007/BF01759039zbMath0718.90064OpenAlexW2072821511MaRDI QIDQ2639771

Clóvis C. Gonzaga

Publication date: 1991

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

central trajectoryinternal search directions

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (18)

Interior-point algorithms for semi-infinite programming ⋮ Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming ⋮ New trajectory-following polynomial-time algorithm for linear programming problems ⋮ An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming ⋮ Interior point algorithms for linear programming with inequality constraints ⋮ On lower bound updates in primal potential reduction methods for linear programming ⋮ A survey of search directions in interior point methods for linear programming ⋮ On Anstreicher's combined phase I-phase II projective algorithm for linear programming ⋮ On combined phase 1-phase 2 projective methods for linear programming ⋮ Search directions for a class of projective methods ⋮ A weighted least squares study of robustness in interior point linear programming ⋮ Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs ⋮ Piecewise linear programming via interior points ⋮ A unified view of interior point methods for linear programming ⋮ Degeneracy in interior point methods for linear programming: A survey ⋮ An alternative derivation of the projective interior point method for linear programming through the least squares approach ⋮ The affine-scaling direction for linear programming is a limit of projective-scaling directions ⋮ Updating lower bounds when using Karmarkar's projective algorithm for linear programming

Cites Work

• A monotonic projective algorithm for fractional linear programming
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A multiplicative barrier function method for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• On the convexity of the multiplicative version of Karmarkar's potential function
• Conical projection algorithms for linear programming
• Karmarkar's linear programming algorithm and Newton's method
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• A variation on Karmarkar’s algorithm for solving linear programming problems
• A variant of Karmarkar's linear programming algorithm for problems in standard form
• Conic Approximations and Collinear Scalings for Optimizers

This page was built for publication: Search directions for interior linear-programming methods