Primal-dual Newton's method with steepest descent for linear programming

DOI10.1007/978-3-030-10934-9_6MaRDI QIDQ2026151zbMATH OpenOpenAlexFDO

Authors Vitaliǐ Grigor'evich Zhadan

Publication date 18 May 2021

Full work available at URL https://doi.org/10.1007/978-3-030-10934-9_6

zbMATH Keywords

linear programmingNewton's methodfinite convergencesteepest descentprimal-dual method

Mathematics Subject Classification ID

Linear programming (90C05) Methods of quasi-Newton type (90C53)

Recommendations

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

Cited in

(8)

• Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
• Dual-primal algorithm for linear optimization
• Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process
• Primal-dual Newton method for linear programming problems
• A primal-dual interior-point method for linear programming based on a weighted barrier function
• Primal-dual path-following methods and the trust-region updating strategy for linear programming with noisy data
• The use of Newton's method for linear programming
• Convergence of the primal-dual Newton method for linear programming problems

This page was built for publication: Primal-dual Newton's method with steepest descent for linear programming

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