Stable barrier-projection and barrier-Newton methods in linear programming
From MaRDI portal
Publication:1342880
DOI10.1007/BF01299205zbMath0823.90084MaRDI QIDQ1342880
Vitali G. Zhadan, Yuri G. Evtushenko
Publication date: 15 January 1995
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Newton's methodconstrained optimizationbarrier functiongradient-projection methodKarmarkar's methodinterior point techniquespace transformation techniques
Related Items
Two differential equation systems for inequality constrained optimization ⋮ Two differential equation systems for equality-constrained optimization ⋮ Convergence analysis of a differential equation approach for solving nonlinear programming problems ⋮ A variant of the affine-scaling method for a second-order cone program ⋮ Differential equation method based on approximate augmented Lagrangian for nonlinear programming ⋮ Direct Newton method for a linear problem of semidefinite programming
Cites Work
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- A quadratically convergent method for linear programming
- A geometric method in nonlinear programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- A relaxation method for solving problems of non-linear programming
- Numerical methods of solving some operational research problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item