scientific article; zbMATH DE number 1187124

zbMATH Open0911.90321MaRDI QIDQ3840328FDOQ3840328

Authors: E. de Klerk, C. Roos, Tamás Terlaky 

Publication date: 28 October 1998

Title of this publication is not available (Why is that?)

Recommendations

• Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• A long-step primal-dual path-following method for semidefinite programming

zbMATH Keywords

semidefinite programmingquadratic convergenceNesterov-Todd directionprimal dual central path following method

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cited In (12)

• Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants
• Some new search directions for primal-dual interior point methods in semidefinite programming
• Title not available (Why is that?)
• Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
• Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
• A long-step primal-dual path-following method for semidefinite programming
• An easy way to teach interior-point methods.
• Interior Point Methods for Nonlinear Optimization
• Title not available (Why is that?)
• Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
• Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
• First- and second-order methods for semidefinite programming

This page was built for publication:

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