Computational experience with ill-posed problems in semidefinite programming

DOI10.1023/A:1013716917710MaRDI QIDQ5960308zbMATH OpenOpenAlexFDO

Authors Gerald Gruber, Franz Rendl

Publication date 15 April 2002

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1013716917710

zbMATH Keywords

damped Newton stepssemidefinite programmingstandard search direction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Methods of quasi-Newton type (90C53)

Recommendations

• A robust algorithm for semidefinite programming
• A primal-dual regularized interior-point method for semidefinite programming
• Preprocessing and regularization for degenerate semidefinite programs
• A primal-dual infeasible interior point algorithm for semidefinite programming
• Infeasible interior point method for semidefinite programs

Cited in

(7)

• Generating and measuring instances of hard semidefinite programs
• Efficient use of semidefinite programming for selection of rotamers in protein conformations
• CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
• A robust algorithm for semidefinite programming
• Preprocessing and regularization for degenerate semidefinite programs
• Validating numerical semidefinite programming solvers for polynomial invariants
• A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs

Describes a project that uses

Uses Software

• SeDuMi
• SDPT3

This page was built for publication: Computational experience with ill-posed problems in semidefinite programming

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