• Maple

  • Referenced in 4993 articles [sw00545]
  • helps you analyze, explore, visualize, and solve mathematical problems. With over 5000 functions, Maple offers...
  • CPLEX

  • Referenced in 2523 articles [sw04082]
  • linear programming (LP) and related problems. Specifically, it solves linearly or quadratically constrained optimization problems...
  • SeDuMi

  • Referenced in 1165 articles [sw04002]
  • SeDuMi is a Matlab toolbox for solving optimization problems over symmetric cones, i.e. it allows...
  • LIBSVM

  • Referenced in 1067 articles [sw04879]
  • LIBSVM. Issues such as solving SVM optimization problems theoretical convergence multiclass classification probability estimates...
  • MACSYMA

  • Referenced in 714 articles [sw01209]
  • solve simple problems specified by one-line commands (such as finding the indefinite integral...
  • Tabu search

  • Referenced in 1034 articles [sw08556]
  • understand basic implementation principles for solving combinatorial or nonlinear problems. We also identify recent developments...
  • VRP

  • Referenced in 971 articles [sw05207]
  • different variants of the problem, alternative algorithms and techniques for solving it, some well-known...
  • SDPT3

  • Referenced in 602 articles [sw04009]
  • This software is designed to solve conic programming problems whose constraint cone is a product ... some examples to illustrate the coding of problem data for our SQLP solver. Various techniques ... solve more than 80% of a total of about 300 test problems to an accuracy...
  • CVX

  • Referenced in 669 articles [sw04594]
  • solving disciplined convex programs (DCPs). CVX supports a number of standard problem types, including linear ... SDPs). CVX can also solve much more complex convex optimization problems, including many involving nondifferentiable ... conveniently formulate and solve constrained norm minimization, entropy maximization, determinant maximization, and many other convex...
  • LMI toolbox

  • Referenced in 1413 articles [sw06383]
  • than that of solving, say, a Riccati equation. For instance, problems with a thousand design...
  • ARPACK

  • Referenced in 780 articles [sw04218]
  • Fortran77 subroutines designed to solve large scale eigenvalue problems. The package is designed to compute ... large scale problems. For many standard problems, a matrix factorization is not required. Only ... needed. ARPACK software is capable of solving large scale symmetric, nonsymmetric, and generalized eigenproblems from...
  • LINPACK

  • Referenced in 513 articles [sw04209]
  • equations and linear least-squares problems. The package solves linear systems whose matrices are general ... matrices and applies them to least-squares problems. LINPACK uses column-oriented algorithms to increase...
  • Mosek

  • Referenced in 362 articles [sw04618]
  • MOSEK is a tool for solving mathematical optimization problems. Some examples of problems MOSEK ... solve are linear programs, quadratic programs, conic problems and mixed integer problems. Such problems occurs...
  • SNOPT

  • Referenced in 497 articles [sw02300]
  • have proved highly effective for solving constrained optimization problems with smooth nonlinear functions ... explicit provision for infeasibility in the original problem and the QP subproblems. SNOPT ... algorithm (SQOPT) for solving the QP subproblems. It is designed for problems with many thousands...
  • PVM

  • Referenced in 305 articles [sw04273]
  • parallel computer. Thus large computational problems can be solved more cost effectively by using ... their existing computer hardware to solve much larger problems at minimal additional cost. Hundreds ... using PVM to solve important scientific, industrial, and medical problems in addition...
  • L-BFGS

  • Referenced in 708 articles [sw03229]
  • limited-memory algorithm for solving large nonlinear optimization problems subject to simple bounds...
  • FreeFem++

  • Referenced in 981 articles [sw01436]
  • enables you to solve Partial Differential Equations (PDE) easily. Problems involving PDE (2d, 3d) from...
  • BARON

  • Referenced in 308 articles [sw00066]
  • computational system for solving nonconvex optimization problems to global optimality. Purely continuous, purely integer ... mixed-integer nonlinear problems can be solved with the software. The Branch And Reduce Optimization ... hills and valleys of complex optimization problems in search of global solutions...
  • top.m

  • Referenced in 201 articles [sw22630]
  • lines are required for solving a well-posed topology optimization problem. By adding ... three additional lines, the program can solve problems with multiple load cases. The code...
  • Smodels

  • Referenced in 238 articles [sw04631]
  • problem. Then we can solve the problem by letting a logic program engine to find...