• Normaliz

  • Referenced in 172 articles [sw00630]
  • computes the defining hyperplanes, and vice versa), convex hulls, a triangulation of a vector...
  • Saga

  • Referenced in 104 articles [sw39677]
  • Gradient Method With Support for Non-Strongly Convex Composite Objectives. In this work we introduce ... regulariser. Unlike SDCA, SAGA supports non-strongly convex problems directly, and is adaptive ... inherent strong convexity of the problem. We give experimental results showing the effectiveness...
  • PolyMesher

  • Referenced in 157 articles [sw13340]
  • element and optimization codes that use linear convex polygons. In topology optimization, polygonal discretizations have...
  • Wirtinger Flow

  • Referenced in 110 articles [sw34175]
  • linear system). This paper develops a non-convex formulation of the phase retrieval problem ... insights for the analysis of non-convex optimization schemes that may have implications for computational...
  • SMOTE

  • Referenced in 152 articles [sw34239]
  • Operating Characteristic curve (AUC) and the ROC convex hull strategy...
  • NESTA

  • Referenced in 133 articles [sw06576]
  • alternatives, such as total-variation minimization and convex programs seeking to minimize...
  • TFOCS

  • Referenced in 133 articles [sw12839]
  • efficient, customized solvers for a variety of convex models, including in particular those employed...
  • CVXPY

  • Referenced in 72 articles [sw13968]
  • CVXPY: A Python-Embedded Modeling Language for Convex Optimization. CVXPY is a domain-specific language ... convex optimization embedded in Python. It allows the user to express convex optimization problems ... solvers. CVXPY makes it easy to combine convex optimization with high-level features of Python...
  • Hull

  • Referenced in 76 articles [sw11670]
  • ANSI C program that computes the convex hull of a point set in general ... list of facets of the convex hull of the points, each facet presented ... Delaunay triangulation, less for convex hulls). Output in postscript and OFF format for geomview...
  • CMA-ES

  • Referenced in 121 articles [sw05063]
  • numerical optimization of non-linear or non-convex continuous optimization problems. They belong...
  • LattE

  • Referenced in 118 articles [sw04654]
  • counting lattice points and integration inside convex polytopes. LattE contains the first ever implementation...
  • GradSamp

  • Referenced in 118 articles [sw05270]
  • real variables, which is not convex and not even locally Lipschitz. The only request formulated...
  • SCALCG

  • Referenced in 108 articles [sw08453]
  • conditions it is shown that, for strongly convex functions, the algorithm is global convergent. Preliminary...
  • GloMIQO

  • Referenced in 77 articles [sw06266]
  • formulated as MIQCQP include: point packing, cutting convex shapes from rectangles, maximizing the area ... convex polygon, and chip layout and compaction. Portfolio optimization in financial engineering can also...
  • SPG

  • Referenced in 76 articles [sw00897]
  • Algorithm 813: SPG -- software for convex-constrained optimization: Fortran 77 software implementing the SPG method ... projected gradient algorithm for solving large-scale convex-constrained optimization problems. It combines the classical...
  • CVXOPT

  • Referenced in 65 articles [sw04321]
  • CVXOPT; Python Software for Convex Optimization. CVXOPT is a free software package for convex optimization ... make the development of software for convex optimization applications straightforward by building on Python...
  • HOPDM

  • Referenced in 74 articles [sw04342]
  • package for solving large scale linear, convex quadratic and convex nonlinear programming problems. The code...
  • plantri

  • Referenced in 72 articles [sw10864]
  • planar graphs, including triangulations, quadrangulations and convex polytopes. Many applications in the natural sciences ... Plantri are given. These include triangulations, quadrangulations, convex polytopes, several classes of cubic and quartic...
  • sparsenet

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

  • Referenced in 51 articles [sw06197]
  • FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs. We describe ... solver for convex mixed-integer nonlinear programs (MINLPs) that implements a linearization-based algorithm ... LP/NLP based branch-and-bound algorithm for convex MINLP optimization problems.” Comput. Chemical Engrg ... these enhancements, an effective solver for convex MINLPs is constructed...