• CMA-ES

  • Referenced in 72 articles [sw05063]
  • free methods for numerical optimization of non-linear or non-convex continuous optimization problems. They...
  • YALMIP

  • Referenced in 458 articles [sw04595]
  • free MATLAB toolbox for rapid prototyping of optimization problems. The package initially aimed ... second order cone programming, semidefinite programming, non-convex semidefinite programming, mixed integer programming, multi-parametric...
  • RPSALG

  • Referenced in 2 articles [sw12637]
  • optimization problems: the first one consists of obtaining an approximate solution of some discretized convex ... second one requires to solve a non-convex optimization problem involving the parametric constraints...
  • bmrm

  • Referenced in 11 articles [sw11016]
  • methods for minimization of convex and non-convex risk under L1 or L2 regularization. Implements ... linear SVM, multi-class SVM, f-beta optimization, ROC optimization, ordinal regression, quantile regression, epsilon...
  • MIDACO

  • Referenced in 3 articles [sw04775]
  • several hundreds to some thousands of optimization variables. MIDACO implements a derivative-free, heuristic algorithm ... contain critical function properties such as non-convexity, discontinuities or stochastic noise. For cpu-time...
  • MISQPOA

  • Referenced in 1 article [sw07024]
  • algorithm and to guarantee global optimlity for convex problems. A mixed-integer linear programming master ... determine a lower bound. Afterwards, a nonlinear optimization program is generated to improve the best ... non-convex and non-relaxable nonlinear mixed-integer programs, but without guaranteeing global optimality...
  • LinAIG

  • Referenced in 6 articles [sw10316]
  • representation called LinAIGs. LinAIGs represent (possibly non-convex) polyhedra extended by Boolean variables. Key components ... Satisfiability Modulo Theories) solvers. Constraint minimization optimizes polyhedra by exploiting the fact that states already...
  • FLO

  • Referenced in 0 articles [sw12272]
  • multiobjective optimization (e.g. concept of Edgeworth-Pareto efficiency). Solving special classes of non-convex single...
  • picasso

  • Referenced in 1 article [sw20406]
  • enjoy the superior statistical property of non-convex penalty such as SCAD and MCP which ... convex penalty such as lasso and ridge. Computation is handled by multi-stage convex relaxation ... unique sparse local optimum with optimal statistical properties. The computation is memory-optimized using...
  • BARON

  • Referenced in 215 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • cdd

  • Referenced in 82 articles [sw00114]
  • The program cdd+ (cdd, respectively) is a C...
  • Gerris

  • Referenced in 123 articles [sw00341]
  • Gerris is a Free Software program for the...
  • GLOPT

  • Referenced in 19 articles [sw00359]
  • GLOPT is a Fortran 77 program for global...
  • INTBIS

  • Referenced in 29 articles [sw00442]
  • Algorithm 681: INTBIS, a portable interval Newton/bisection package...
  • KNITRO

  • Referenced in 109 articles [sw00490]
  • KNITRO is a solver for nonlinear optimization. It...
  • LANCELOT

  • Referenced in 247 articles [sw00500]
  • LANCELOT. A Fortran package for large-scale nonlinear...
  • Mathematica

  • Referenced in 4133 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • Matlab

  • Referenced in 7110 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • MiniSat

  • Referenced in 355 articles [sw00577]
  • An extensible SAT-solver. MiniSat is a minimalistic...
  • QEPCAD

  • Referenced in 221 articles [sw00752]
  • QEPCAD B: A program for computing with semi...