Solving a class of semidefinite programs via nonlinear programming

DOI10.1007/S101070100279zbMATH Open1007.90045OpenAlexW2164948865MaRDI QIDQ1849262FDOQ1849262

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

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

Recommendations

• A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
• Semidefinite Programming
• Interior-point algorithms for semidefinite programming based on a nonlinear formulation
• An inexact dual logarithmic barrier method for solving sparse semidefinite programs
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

zbMATH Keywords

first-order methodsnonlinear programminginterior-point methodstransformationsemidefinite relaxationsemidefinite programlog-barrier algorithms

Mathematics Subject Classification ID

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

Cited In (28)

• Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
• Title not available (Why is that?)
• Global minimization of polynomial integral functionals
• Title not available (Why is that?)
• Finding a strict feasible solution of a linear semidefinite program
• Computational enhancements in low-rank semidefinite programming
• On verified numerical computations in convex programming
• A sequential quadratic penalty method for nonlinear semidefinite programming
• An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
• On extracting maximum stable sets in perfect graphs using Lovász's theta function
• Title not available (Why is that?)
• A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
• An inexact primal-dual path following algorithm for convex quadratic SDP
• A sequential quadratic penalty method for nonlinear semidefinite programming
• Interior-point algorithms for semidefinite programming based on a nonlinear formulation
• \(LDL^T\) direction interior point method for semidefinite programming
• Lower-order penalization approach to nonlinear semidefinite programming
• Solving highly nonlinear convex separable programs using successive approximation
• Exact SDP relaxations for classes of nonlinear semidefinite programming problems
• Local minima and convergence in low-rank semidefinite programming
• An efficient approach to solve the large-scale semidefinite programming problems
• Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
• Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
• Title not available (Why is that?)
• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
• Efficient rank reduction of correlation matrices
• Approximate augmented Lagrangian functions and nonlinear semidefinite programs
• Large-scale semidefinite programming via a saddle point mirror-prox algorithm

Uses Software

• COL

This page was built for publication: Solving a class of semidefinite programs via nonlinear programming

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