Interior-point algorithms for semidefinite programming based on a nonlinear formulation

DOI10.1023/A:1014834318702zbMATH Open1006.90060OpenAlexW1604432248MaRDI QIDQ1610312FDOQ1610312

Samuel Burer, Renato D. C. Monteiro, Yin Zhang

Publication date: 19 August 2002

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

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

Recommendations

• A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
• A trust region method for solving semidefinite programs
• Solving a class of semidefinite programs via nonlinear programming
• A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

zbMATH Keywords

nonlinear programmingsemidefinite programminginterior-point methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51) Semidefinite programming (90C22)

Cited In (13)

• $LDL^T$ Direction Interior Point Method for Semidefinite Programming
• A sequential quadratic penalty method for nonlinear semidefinite programming
• A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
• A sequential quadratic penalty method for nonlinear semidefinite programming
• On the Turing model complexity of interior point methods for semidefinite programming
• Primal-dual Newton-type interior-point method for topology optimization
• Lower-order penalization approach to nonlinear semidefinite programming
• Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
• Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
• Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• Solving a class of semidefinite programs via nonlinear programming
• Approximate augmented Lagrangian functions and nonlinear semidefinite programs

Uses Software

• SDPLR
• DIMACS

This page was built for publication: Interior-point algorithms for semidefinite programming based on a nonlinear formulation

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