Homotopy techniques in linear programming
From MaRDI portal
Publication:1091937
DOI10.1007/BF01840461zbMath0623.90052MaRDI QIDQ1091937
Publication date: 1986
Published in: Algorithmica (Search for Journal in Brave)
interior point methods; path-following; quadratic regularization; Karmarkar's method; homotopy technique; local search direction
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90C05: Linear programming
Related Items
The DLP decision support system and its extension to stochastic programming∗, A quadratically convergent method for linear programming, Introduction: New approaches to linear programming, A new simple homotopy algorithm for linear programming. I, Deriving potential functions via a symmetry principle for nonlinear equations, The implementation of linear programming algorithms based on homotopies
Cites Work
- A new polynomial-time algorithm for linear programming
- A convergent process of price adjustment and global Newton methods
- The Solution of Systems of Piecewise Linear Equations
- Iterative Solution of Linear Programs
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- On Algorithms for Solvingf(x)=0
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item