Primal-dual Newton method for linear programming problems
From MaRDI portal
Publication:5932863
zbMath0964.90023MaRDI QIDQ5932863
No author found.
Publication date: 17 June 2001
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Linear programming (90C05) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (3)
Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process ⋮ Newton's method for minimizing a convex twice differentiable function on a preconvex set ⋮ Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
This page was built for publication: Primal-dual Newton method for linear programming problems
