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

DOI10.1023/A:1014834318702zbMath1006.90060OpenAlexW1604432248MaRDI QIDQ1610312

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

zbMATH Keywords

semidefinite programmingnonlinear programminginterior-point methods

Mathematics Subject Classification ID

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

Related Items (6)

$LDL^T$ Direction Interior Point Method for Semidefinite Programming ⋮ Approximate augmented Lagrangian functions and nonlinear semidefinite programs ⋮ Lower-order penalization approach to nonlinear semidefinite programming ⋮ A sequential quadratic penalty method for nonlinear semidefinite programming ⋮ A sequential quadratic penalty method for nonlinear semidefinite programming ⋮ Primal-dual Newton-type interior-point method for topology optimization

Uses Software

• SDPLR
• DIMACS

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