• LMI toolbox

  • Referenced in 1211 articles [sw06383]
  • solvers are significantly faster than classical convex optimization algorithms, it should be kept in mind...
  • CVX

  • Referenced in 411 articles [sw04594]
  • also solve much more complex convex optimization problems, including many involving nondifferentiable functions, such ... entropy maximization, determinant maximization, and many other convex programs. As of version 2.0, CVX also...
  • CPLEX

  • Referenced in 2069 articles [sw04082]
  • optimized can be expressed as a linear function or a convex quadratic function. The variables...
  • UNLocBoX

  • Referenced in 143 articles [sw07521]
  • UNLocboX is a matlab convex optimization toolbox part of the UnlocX project. It composed...
  • SPG

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

  • Referenced in 126 articles [sw00490]
  • linear, quadratic, and nonlinear smooth optimization problems, both convex and nonconvex. It is also effective ... MPECs), and mixed-integer programming (MIPs), particular convex mixed integer, nonlinear problems (MINLP). KNITRO ... KNITRO will remain the leader in nonlinear optimization...
  • CMA-ES

  • Referenced in 80 articles [sw05063]
  • optimization of non-linear or non-convex continuous optimization problems. They belong to the class...
  • ACCPM

  • Referenced in 56 articles [sw06707]
  • package for solving large scale convex optimization problems. The code is an implementation...
  • CVXOPT

  • Referenced in 32 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...
  • LINGO

  • Referenced in 244 articles [sw04942]
  • Nonlinear (convex & nonconvex/Global), Quadratic, Quadratically Constrained, Second Order Cone, Stochastic, and Integer optimization models faster...
  • CVXGEN

  • Referenced in 26 articles [sw07151]
  • CVXGEN: a code generator for embedded convex optimization. CVXGEN is a software tool that takes ... high level description of a convex optimization problem family, and automatically generates custom C code ... families that can be transformed, using disciplined convex programming techniques, to convex quadratic programs...
  • YALMIP

  • Referenced in 630 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...
  • SONEST

  • Referenced in 29 articles [sw24351]
  • algorithms are based on a convex optimization method for estimating the 1-norm...
  • CONEST

  • Referenced in 29 articles [sw24352]
  • algorithms are based on a convex optimization method for estimating the 1-norm...
  • SLEP

  • Referenced in 24 articles [sw13487]
  • 1/k2) is optimal for smooth convex optimization via the first-order black-box methods...
  • FilMINT

  • Referenced in 41 articles [sw06197]
  • based branch-and-bound algorithm for convex MINLP optimization problems.” Comput. Chemical Engrg ... these enhancements, an effective solver for convex MINLPs is constructed...
  • CVXPY

  • Referenced in 14 articles [sw13968]
  • Python-Embedded Modeling Language for Convex Optimization. CVXPY is a domain-specific language for convex ... allows the user to express convex optimization problems in a natural syntax that follows ... CVXPY makes it easy to combine convex optimization with high-level features of Python such...
  • CONLIN

  • Referenced in 40 articles [sw14151]
  • CONLIN: An efficient dual optimizer based on convex approximation concepts. The Convex Linearization method (CONLIN ... applicable to a broad class of structural optimization problems. The method employs mixed design variables ... function and to the constraints. The primary optimization problem is therefore replaced with a sequence ... simple algebraic structure. The explicit subproblems are convex and separable, and they can be solved...
  • AlphaECP

  • Referenced in 33 articles [sw04940]
  • problems and global optimal solutions can be ensured for pseudo-convex MINLP problems ... plane method which was originally given for convex NLP problems (Kelley, 1960). The method requires ... problems may be solved to optimality, but can also be solved to feasibility or only ... Pörn R. (2002). Solving Pseudo-Convex Mixed Integer Optimization Problems by Cutting Plane Techniques. Optimization...
  • LS-SVMlab

  • Referenced in 20 articles [sw07367]
  • minimization. In the methods one solves convex optimization problems, typically quadratic programs. Least Squares Support...