• Biq Mac

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

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

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

  • Referenced in 42 articles [sw04782]
  • Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs The Goemans--Williamson ... need for solving an expensive semidefinite relaxation. In order to achieve better practical performance ... rank-two relaxation heuristics is compared with two state-of-the-art semidefinite programming codes...
  • SFSDP

  • Referenced in 33 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 45 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...
  • PhaseMax

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

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

  • Referenced in 13 articles [sw28194]
  • Bernard Lasserre ”Approximating Pareto curves using semidefinite relaxations” (on the arxiv). 2) Images of semialgebraic ... Magron, Didier Henrion and Jean-Bernard Lasserre ”Semidefinite approximations of projections and polynomial images...
  • SE-Sync

  • Referenced in 12 articles [sw40678]
  • approach is the development of a semidefinite relaxation of the maximum-likelihood estimation whose minimizer...
  • TSSOS

  • Referenced in 17 articles [sw36859]
  • obtain a new converging hierarchy of semidefinite programming relaxations. The novelty (and distinguishing feature...
  • SDPLIB

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

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

  • Referenced in 2 articles [sw34017]
  • OPFSDR: Semidefinite Relaxation of Optimal Power Flow Problems. This repository contains a rudimentary implementation ... semidefinite relaxation techniques for AC optimal power flow problems, based on the following papers ... Hansson, L. Vandenberghe, ”Reduced-Complexity Semidefinite Relaxations of Optimal Power Flow Problems”, IEEE Transactions ... Robustness and Scalability of Semidefinite Relaxation for Optimal Power Flow Problems”, Optimization and Engineering...
  • Ncpol2sdpa

  • Referenced in 4 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...
  • SDPNAL+

  • Referenced in 63 articles [sw13239]
  • method for solving two-easy-block structured semidefinite programs”, Math. Program. Comput ... difficult SDP problems arising from the relaxations of quadratic assignment problems tested in SDPNAL...
  • 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 low-rank semidefinite programming (LRSDP) relaxations of unconstrained ${-1,1}$ quadratic problems...
  • SCIP-SDP

  • Referenced in 14 articles [sw15618]
  • semidefinite programs (SDPs). It implements a SDP-based branch-and-cut approach. The SDP-relaxations...