On convergence of the dual Newton method for a linear semidefinite programming problem

MaRDI QIDQ447684zbMATH OpenFDO

Authors Vitaliǐ Grigor'evich Zhadan, Aleksandr Alehseevich Orlov

Publication date 5 September 2012

Published in The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

zbMATH Keywords

local convergenceNewton's methoddual problem

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• Direct Newton method for a linear problem of semidefinite programming
• An admissible dual internal point method for a linear semidefinite programming problem
• Dual interior point methods for linear semidefinite programming problems
• A variant of the dual simplex method for a linear semidefinite programming problem
• Convergence of the primal-dual Newton method for linear programming problems

Cited in

(15)

• Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity
• 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
• Dual Newton's methods for linear second-order cone programming
• scientific article; zbMATH DE number 5778001 (Why is no real title available?)
• A semilocal convergence analysis for Newton LP methods
• Convergence of a short-step primal-dual algorithm based on the Gauss-Newton direction
• Dual interior point methods for linear semidefinite programming problems
• An admissible dual internal point method for a linear semidefinite programming problem
• Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process
• Convergence of a dual-variable vector sequence in a semi-definite programming problem
• Direct Newton method for a linear problem of semidefinite programming
• Generalized Newton method for linear optimization problems with inequality constraints
• A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem
• On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization

This page was built for publication: On convergence of the dual Newton method for a linear semidefinite programming problem

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