Solving a class of semidefinite programs via nonlinear programming
From MaRDI portal
Publication:1849262
DOI10.1007/s101070100279zbMath1007.90045OpenAlexW2164948865MaRDI QIDQ1849262
Yin Zhang, Samuel Burer, Renato D. C. Monteiro
Publication date: 1 December 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100279
nonlinear programmingtransformationinterior-point methodssemidefinite relaxationfirst-order methodssemidefinite programlog-barrier algorithms
Related Items
On verified numerical computations in convex programming, Large-scale semidefinite programming via a saddle point mirror-prox algorithm, Efficient rank reduction of correlation matrices, SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances, $LDL^T$ Direction Interior Point Method for Semidefinite Programming, Local minima and convergence in low-rank semidefinite programming, Approximate augmented Lagrangian functions and nonlinear semidefinite programs, On extracting maximum stable sets in perfect graphs using Lovász's theta function, An inexact primal-dual path following algorithm for convex quadratic SDP, Lower-order penalization approach to nonlinear semidefinite programming, Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs, Computational enhancements in low-rank semidefinite programming, Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations, A sequential quadratic penalty method for nonlinear semidefinite programming, A sequential quadratic penalty method for nonlinear semidefinite programming
Uses Software
