• # SparsePOP

• Referenced in 67 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...
• # SFSDP

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

• Referenced in 59 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...

• Referenced in 8 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...
• # SDPLIB

• Referenced in 67 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...
• # 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...
• # 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...
• # SpeeDP

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