Primal-dual Newton method for linear programming problems

MaRDI QIDQ5932863zbMATH OpenFDO

Authors V. G. Zhadan

Publication date 17 June 2001

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

complementary linear problemlinear programmingNewton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of quasi-Newton type (90C53)

Recommendations

• Primal-dual Newton's method with steepest descent for linear programming
• Convergence of the primal-dual Newton method for linear programming problems
• scientific article; zbMATH DE number 1120265
• Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
• The use of Newton's method for linear programming

Cited in

(13)

• Primal Newton method for the linear cone programming problem
• The use of Newton's method for linear programming
• Primal-dual Newton's method with steepest descent for linear programming
• Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
• The LP-Newton method for standard form linear programming problems
• Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process
• scientific article; zbMATH DE number 1120265 (Why is no real title available?)
• Generalized Newton method for linear optimization problems with inequality constraints
• Application on Newton and augmented Lagrangian methods to linear programming
• scientific article; zbMATH DE number 2208632 (Why is no real title available?)
• Convergence of the primal-dual Newton method for linear programming problems
• On first experiences with the implementation of a Newton based linear programming approach
• Newton's method for minimizing a convex twice differentiable function on a preconvex set

This page was built for publication: Primal-dual Newton method for linear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932863)