
SparsePOP
 Referenced in 65 articles
[sw04331]
 SparsePOP: a sparse semidefinite programming relaxation of polynomial optimization problems. SparsePOP is a Matlab ... implementation of the sparse semidefinite programming (SDP) relaxation method for approximating a global optimal solution ... Waki et al. [2006]. The sparse SDP relaxation exploits a sparse structure of polynomials...

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

SNLSDP
 Referenced in 38 articles
[sw05127]
 problems. The algorithm first solves an SDP relaxation (with regularization) of the nonconvex minimization...

SFSDP
 Referenced in 32 articles
[sw04793]
 Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems SFSDP ... networks. SFSDP implements the semidefinite programming (SDP) relaxation proposed...

MaxAO
 Referenced in 22 articles
[sw05032]
 solves SDP relaxations of maximum stable set and maximum clique problems,graph input...

SDPNAL+
 Referenced in 41 articles
[sw13239]
 difficult SDP problems arising from the relaxations of quadratic assignment problems tested in SDPNAL ... nonsym(21,4), in which its resulting SDP problem has matrix dimension...

SCIPSDP
 Referenced in 11 articles
[sw15618]
 based branchandcut approach. The SDPrelaxations are solved using interiorpoint SDPsolvers...

SDPLIB
 Referenced in 60 articles
[sw00838]
 SDLIB is a collection of semidefinite programming (SDP) test problems. The problems are drawn from ... truss topology design, control systems engineering, and relaxations of combinatorial optimization problems. The current version ... library contain a total of 92 SDP problems encoded in a standard format...

ADMM_QAP
 Referenced in 5 articles
[sw31756]
 ADMM for the SDP relaxation of the QAP. Semidefinite programming, SDP, relaxations have proven ... that arise in efficiently solving the SDP relaxation, e.g., increased dimension; inefficiency of the current ... facial reduction, FR, to solve the SDP relaxation. This first order approach allows for: inexpensive ... doubly nonnegative, DNN, relaxation that includes both the SDP and all the nonnegativity constraints. When...

SDP_S
 Referenced in 21 articles
[sw07708]
 SDP_S is an implementation of the algorithm proposed in the paper ”From Linear ... Algorithm to obtain Semidefinite Relaxations for Bivalent Quadratic Problems”. SDP_S has been mainly written...

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

DSPCA
 Referenced in 35 articles
[sw04804]
 constrained, and derive a semidefinite programming based relaxation for our problem. We also discuss Nesterov ... smooth minimization technique applied to the SDP arising in the direct sparse PCA method...

Ncpol2sdpa
 Referenced in 3 articles
[sw17564]
 variables. A hierarchy of semidefinite programming (SDP) relaxations approximates the global optimum of polynomial optimization...

MaximinOPF.jl
 Referenced in 1 article
[sw37647]
 power flow, which include the SDP and SOCP relaxations, and the DC or other linear...

SpeeDP
 Referenced in 4 articles
[sw07003]
 SpeeDP: an algorithm to compute SDP bounds for very large maxcut instances We consider ... rank semidefinite programming (LRSDP) relaxations of unconstrained ${1,1}$ quadratic problems (or, equivalently...

borderbasix
 Referenced in 1 article
[sw16958]
 connection with SDP solvers has been integrated for the combination of relaxation approaches with border...

BARON
 Referenced in 324 articles
[sw00066]
 BARON is a computational system for solving nonconvex...

CSDP
 Referenced in 200 articles
[sw00169]
 CSDP, A C Library for Semidefinite Programming. This...

Matlab
 Referenced in 12477 articles
[sw00558]
 MATLAB® is a highlevel language and interactive...

NTL
 Referenced in 206 articles
[sw00638]
 NTL is a highperformance, portable C++ library...