Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations

DOI10.1134/S0965542522020129zbMath1487.90519OpenAlexW4220861618MaRDI QIDQ2116587

Yanyan Li

Publication date: 18 March 2022

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

Full work available at URL: https://doi.org/10.1134/s0965542522020129

zbMATH Keywords

optimality conditionssteepest descentlinear semidefinite programming problemprimal-dual Newton's method

Mathematics Subject Classification ID

Semidefinite programming (90C22) Methods of quasi-Newton type (90C53)

Related Items (2)

Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process ⋮ Generalization of the subset sum problem and cubic forms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• First- and second-order methods for semidefinite programming
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Semidefinite optimization
• The Elimination Matrix: Some Lemmas and Applications
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Semidefinite Programming
• ON MATRICES DEPENDING ON PARAMETERS
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Primal-dual Newton method for linear programming problems
• Convergence of the primal-dual Newton method for linear programming problems

This page was built for publication: Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations