Scaling, shifting and weighting in interior-point methods

DOI10.1007/BF01299206zbMath0924.90112OpenAlexW2077516534MaRDI QIDQ1342881

Michael J. Todd

Publication date: 15 January 1995

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

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

zbMATH Keywords

interior-point methodsscaling, shifting and weighting strategies

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (2)

Convergence of a weighted barrier algorithm for stochastic convex quadratic semidefinite optimization ⋮ Largest dual ellipsoids inscribed in dual cones

Cites Work

• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
• Modified barrier functions (theory and methods)
• Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
• A variation on Karmarkar’s algorithm for solving linear programming problems
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• On the Implementation of a Primal-Dual Interior Point Method
• Path-Following Methods for Linear Programming
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• The convergence of a modified barrier method for convex programming
• Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scaling, shifting and weighting in interior-point methods