scientific article; zbMATH DE number 1091399

MaRDI QIDQ4367135zbMATHFDO

Authors Miaogen Shi, Jian-Min Jiang

Publication date 8 September 1998

zbMATH Keywords

convergencesemidefinite programmingNewton methodpath-following methodlogarithmic barrier method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Recommendations

• A logarithm barrier method for semi-definite programming
• scientific article; zbMATH DE number 1182576
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• scientific article; zbMATH DE number 1247169

Cited in

(10)

• The volumetric barrier for semidefinite programming.
• A new barrier for a class of semidefinite problems
• A logarithm barrier method for semi-definite programming
• On the New Barrier Function and Specialized Algorithms for a Class of Semidefinite Programs
• Penalty and barrier methods for convex semidefinite programming
• A long-step primal-dual path-following method for semidefinite programming
• An extension of the standard polynomial-time primal-dual path-following algorithm to the weighted determination maximization problem with semidefinite contstraints
• A relaxed logarithmic barrier method for semidefinite programming
• Two logarithmic barrier methods for convex semi-infinite problems.
• Logarithmic barrier method via minorant function for linear 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 Q4367135)