• Bonmin

  • Referenced in 211 articles [sw04766]
  • mixed integer nonlinear problems that exhibit convex continuous relaxations, on which the experiments are carried...
  • sparsenet

  • Referenced in 94 articles [sw19133]
  • purpose, along with a variety of convex-relaxation algorithms for finding good solutions. We pursue...
  • libMC

  • Referenced in 47 articles [sw06615]
  • automatic generation of convex and concave relaxations of a given factorable function, a recursive procedure ... calculates enclosures as well as convex and concave relaxations recursively for each of these intermediate ... McCormick relaxation techniques [3]. Because McCormick relaxations are generally non-smooth, subgradients (as opposed ... with each elementary operation of convex and concave relaxation, additional variables are introduced which store...
  • clusterpath

  • Referenced in 29 articles [sw41747]
  • clustering algorithm by proposing a convex relaxation of hierarchical clustering, which results in a family ... results similar to spectral clustering for non-convex clusters, and has the added benefit...
  • pottslab

  • Referenced in 19 articles [sw14425]
  • methods based on graph cuts and convex relaxations of the Potts model which are presently ... that of graph cuts and the convex relaxation strategies, and we do not need...
  • CMU-IBM

  • Referenced in 12 articles [sw13495]
  • mixed-integer nonlinear programs (MINLP) with convex relaxation. The main objectives of this effort...
  • SNLSDP

  • Referenced in 38 articles [sw05127]
  • first solves an SDP relaxation (with regularization) of the non-convex minimization problem...
  • MINOTAUR

  • Referenced in 28 articles [sw06268]
  • problems. We study methods for building polyhedral relaxations of multilinear terms that arise in nonconvex ... more compact than the convex hull formulation, but yields tighter relaxations than the standard McCormick...
  • PhaseMax

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

  • Referenced in 59 articles [sw06707]
  • package for solving large scale convex optimization problems. The code is an implementation ... cutting plane method. Instead of solving every relaxed master problem to optimality...
  • NCVX

  • Referenced in 4 articles [sw24075]
  • convex set. The heuristics, which employ convex relaxations, convex restrictions, local neighbour search methods...
  • MSCRA_rankmin

  • Referenced in 3 articles [sw37064]
  • multi-stage convex relaxation approach to noisy structured low-rank matrix recovery. This paper concerns ... obtain a multi-stage convex relaxation approach. We provide theoretical guarantees for our approach under ... rank bounds of the first stage convex relaxation in the subsequent stages and establishing...
  • DIFFRAC

  • Referenced in 5 articles [sw23902]
  • discriminative cost function and a convex relaxation of a combinatorial op- timization problem. The large...
  • ADMBB

  • Referenced in 5 articles [sw31752]
  • based on alternative direction method and convex relaxation. We consider a quadratic program with ... subject to linear and convex quadratic constraints that covers many applications and is known...
  • REPOP

  • Referenced in 5 articles [sw41948]
  • Toolbox: Tackling Polynomial Optimization Using Relative Entropy Relaxations. Polynomial optimization is an active field ... optimal solution, by employing appropriate convex relaxations of the original problem. In this direction...
  • QPsimplex

  • Referenced in 5 articles [sw31751]
  • necessary for the efficient solution of convex relaxations repeatedly at the nodes of the search ... simplex-based quadratic programming algorithms to solve convex as well as discrete instances and compare...
  • RRK_rr

  • Referenced in 16 articles [sw34461]
  • Relaxation Runge-Kutta methods are modifications of Runge-Kutta methods that enforce conservation, dissipation ... respect to any convex functional by the addition of a relaxation parameter that multiplies...
  • AlphaECP

  • Referenced in 49 articles [sw04940]
  • plane method which was originally given for convex NLP problems (Kelley, 1960). The method requires ... feasibility or only to an integer relaxed solution in intermediate iterations. This makes ... Pörn R. (2002). Solving Pseudo-Convex Mixed Integer Optimization Problems by Cutting Plane Techniques. Optimization...
  • OPF

  • Referenced in 3 articles [sw18724]
  • This solver aims to solve a convex relaxation for a large-scale Optimal Power Flow...
  • picasso

  • Referenced in 3 articles [sw20406]
  • Computation is handled by multi-stage convex relaxation and the PathwIse CAlibrated Sparse Shooting algOrithm...