
Biq Mac
 Referenced in 64 articles
[sw10532]
 optimality by intersecting semidefinite and polyhedral relaxations. We present a method for finding exact solutions ... optimal” solution of the basic semidefinite MaxCut relaxation, strengthened by triangle inequalities. The expensive ... bounding procedure is solving the basic semidefinite relaxation of the MaxCut problem, which...

SparsePOP
 Referenced in 58 articles
[sw04331]
 SparsePOP: a sparse semidefinite programming relaxation of polynomial optimization problems. SparsePOP is a Matlab implementation ... sparse semidefinite programming (SDP) relaxation method for approximating a global optimal solution of a polynomial...

GloptiPoly
 Referenced in 247 articles
[sw04343]
 hierarchy of semidefinite programming (SDP), or linear matrix inequality (LMI) relaxations of the GPM, whose...

CirCut
 Referenced in 42 articles
[sw04782]
 Ranktwo relaxation heuristics for MAXCUT and other binary quadratic programs The GoemansWilliamson ... need for solving an expensive semidefinite relaxation. In order to achieve better practical performance ... ranktwo relaxation heuristics is compared with two stateoftheart semidefinite programming codes...

SFSDP
 Referenced in 31 articles
[sw04793]
 SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems SFSDP ... sensor networks. SFSDP implements the semidefinite programming (SDP) relaxation proposed ... sparse version of the full semidefinite programming relaxation (FSDP) by Biswas...

Outward rotations
 Referenced in 44 articles
[sw08660]
 tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other ... rotations, for enhancing the performance of several semidefinite programming based approximation algorithms. Using outward rotations...

SDP_S
 Referenced in 20 articles
[sw07708]
 Semidefinite Programming: an Algorithm to obtain Semidefinite Relaxations for Bivalent Quadratic Problems...

DSPCA
 Referenced in 35 articles
[sw04804]
 constrained, and derive a semidefinite programming based relaxation for our problem. We also discuss Nesterov...

PhaseMax
 Referenced in 10 articles
[sw24954]
 Unlike other convex methods that use semidefinite relaxation and lift the phase retrieval problem...

ParetoImageSDP
 Referenced in 9 articles
[sw28194]
 Bernard Lasserre ”Approximating Pareto curves using semidefinite relaxations” (on the arxiv). 2) Images of semialgebraic ... Magron, Didier Henrion and JeanBernard Lasserre ”Semidefinite approximations of projections and polynomial images...

SDPLIB
 Referenced in 60 articles
[sw00838]
 test problems. SDLIB is a collection of semidefinite programming (SDP) test problems. The problems ... truss topology design, control systems engineering, and relaxations of combinatorial optimization problems. The current version...

Ncpol2sdpa
 Referenced in 3 articles
[sw17564]
 Algorithm 950: Ncpol2sdpa  sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables ... hierarchy of semidefinite programming (SDP) relaxations approximates the global optimum of polynomial optimization problems...

ADMM_QAP
 Referenced in 4 articles
[sw31756]
 relaxation of the QAP. Semidefinite programming, SDP, relaxations have proven to be extremely strong...

NLCertify
 Referenced in 4 articles
[sw08786]
 using a hierarchy of semidefinite (SDP) relaxations, via an interface with the external SDPA solver...

SpeeDP
 Referenced in 4 articles
[sw07003]
 instances We consider lowrank semidefinite programming (LRSDP) relaxations of unconstrained ${1,1}$ quadratic problems...

SDPNAL+
 Referenced in 30 articles
[sw13239]
 method for solving twoeasyblock structured semidefinite programs”, Math. Program. Comput ... difficult SDP problems arising from the relaxations of quadratic assignment problems tested in SDPNAL...

POS3POLY
 Referenced in 3 articles
[sw09847]
 optimization with positive polynomials. Positive polynomials, relaxed to sumofsquares in the multivariate case ... library, which transforms polynomial positivity into positive semidefinite constraints, thus enabling the user to solve...

BBCPOP
 Referenced in 1 article
[sw31757]
 problem (COP), which serves as a DNN relaxation of the POP, and then solves ... which are the Cartesian product of positive semidefinite cones and a polyhedral cone induced from...

Apron
 Referenced in 61 articles
[sw00045]
 Apron: a library of numerical abstract domains for...

ATLAS
 Referenced in 194 articles
[sw00056]
 This paper describes the Automatically Tuned Linear Algebra...