Direct Newton method for a linear problem of semidefinite programming

DOI10.1134/S0081543808060138zbMATH Open1194.90067MaRDI QIDQ735655FDOQ735655

Authors: D. Kharzeev 

Publication date: 23 October 2009

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Recommendations

• Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
• On convergence of the dual Newton method for a linear semidefinite programming problem
• A primal interior point method for the linear semidefinite programming problem
• Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process
• A variant of the dual simplex method for a linear semidefinite programming problem

zbMATH Keywords

dual variables

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• A primal interior point method for the linear semidefinite programming problem
• The Elimination Matrix: Some Lemmas and Applications
• Stable barrier-projection and barrier-Newton methods in linear programming

Cited In (5)

• Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
• Newton's method for minimizing a convex twice differentiable function on a preconvex set
• On convergence of the dual Newton method for a linear semidefinite programming problem
• Some structural properties of a Newton-type method for semidefinite programs
• Title not available (Why is that?)

This page was built for publication: Direct Newton method for a linear problem of semidefinite programming

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