Exterior minimum-penalty path-following methods in semidefinite programming

DOI10.1023/A:1021782202975MaRDI QIDQ1280099zbMATH OpenFDO

Authors K. Appert

Publication date 17 May 1999

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1021782202975

zbMATH Keywords

constraint-aggregation methodconvex programmingexterior path-following methodslinear matrix inequalitieslinear programmingminimum-penalty pathsemidefinite programming

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Linear programming (90C05) Convex programming (90C25)

Recommendations

• Penalty and barrier methods for convex semidefinite programming
• scientific article; zbMATH DE number 1091399
• First- and second-order methods for semidefinite programming
• scientific article; zbMATH DE number 1182576

Cites work

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 46153 (Why is no real title available?)
• scientific article; zbMATH DE number 2005717 (Why is no real title available?)
• scientific article; zbMATH DE number 861670 (Why is no real title available?)
• Linear Matrix Inequalities in System and Control Theory
• On analyticity of functions involving eigenvalues

Cited in

(2)

• Path following in the exact penalty method of convex programming
• Penalty and barrier methods for convex semidefinite programming

This page was built for publication: Exterior minimum-penalty path-following methods in semidefinite programming

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