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

DOI10.1134/S0965542522020129zbMATH Open1487.90519OpenAlexW4220861618MaRDI QIDQ2116587FDOQ2116587

Authors: 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

Recommendations

• Primal-dual Newton's method with steepest descent for linear programming
• Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process
• Primal-dual Newton method for linear programming problems
• Convergence of the primal-dual Newton method for linear programming problems
• Direct Newton method for a linear problem of semidefinite programming
• Primal Newton method for the linear cone programming problem
• On the Primal-Dual Steepest Descent Algorithm for Extended Linear-Quadratic Programming
• New complexity analysis of the primal-dual Newton method for linear optimization
• On a primal-dual Newton proximal method for convex quadratic programs
• On convergence of the dual Newton method for a linear semidefinite programming problem

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)

Cites Work

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

Cited In (4)

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

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

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