• # YALMIP

• Referenced in 864 articles [sw04595]
• quadratic programming, second order cone programming, semidefinite programming, non-convex semidefinite programming, mixed integer programming...
• # CVX

• Referenced in 636 articles [sw04594]
• modeling system for constructing and solving disciplined convex programs (DCPs). CVX supports a number ... cone programs (SOCPs), and semidefinite programs (SDPs). CVX can also solve much more complex convex...
• # LINGO

• Referenced in 277 articles [sw04942]
• solving Linear, Nonlinear (convex & nonconvex/Global), Quadratic, Quadratically Constrained, Second Order Cone, Stochastic, and Integer optimization...
• # Normaliz

• Referenced in 142 articles [sw00630]
• cone (in other words, given generators, Normaliz computes the defining hyperplanes, and vice versa), convex ... basis of a (not necessarily pointed) rational cone, the lattice points of a rational polytope...
• # Convex

• Referenced in 30 articles [sw07770]
• also called a polytope. In the Convex package, polyhedra are represented by the type POLYHEDRON ... intersection. The linear setting is based on cones, which are intersections of finitely many linear ... finitely many rays. In the Convex package, cones are represented by the type CONE. They ... full-dimensional. A CONE can be created from either description with the functions poshull...
• # FourierMotzkin

• Referenced in 2 articles [sw27120]
• convex hull and vertex enumeration. A convex cone is polyhedral if it is a finite ... intersection of halfspaces. A convex cone is finitely generated ... theorem for cones states that a convex cone is polyhedral if and only ... between these two basic representations for convex cones. For polytopes, this allows one to convert...
• # OldPolyhedra

• Referenced in 2 articles [sw27525]
• Macaulay2 package OldPolyhedra -- for computations with convex polyhedra, cones, and fans. A rational convex Polyhedron ... vertices and rays. A rational convex polyhedral Cone is the intersection of finitely many linear...
• # Convex.jl

• Referenced in 1 article [sw27000]
• Convex.jl is a Julia package for Disciplined Convex Programming (DCP). Convex.jl makes it easy ... mixed-integer second-order cone programs; dcp-compliant convex programs including second-order cone programs...
• # ECOS

• Referenced in 30 articles [sw12123]
• solving optimization problems with second-order cone constraints (SOCPs). This includes linear (LPs), quadratic ... efficient standard algorithm for solving convex optimization problems. It uses regularization and iterative refinement techniques...
• # CVXR

• Referenced in 5 articles [sw22020]
• programming (DCP) to verify the problem’s convexity. Once verified, the problem is converted into ... using graph implementations and passed to a cone solver such as ECOS...
• # SPOT

• Referenced in 4 articles [sw21276]
• operations, a special class mssprog for defining convex optimization problems (to be solved by SeDuMi ... terms of polynomial identities and self-dual cones, and a set of functions for identification...