
YALMIP
 Referenced in 864 articles
[sw04595]
 quadratic programming, second order cone programming, semidefinite programming, nonconvex 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...

PORTA
 Referenced in 115 articles
[sw04869]
 points plus (possibly) the convex cone of a set of vectors, or as a system...

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

OrthoMADS
 Referenced in 43 articles
[sw07713]
 orthogonal to each other, which yields convex cones of missed directions at each iteration that...

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 ... fulldimensional. A CONE can be created from either description with the functions poshull...

SDLS
 Referenced in 7 articles
[sw04788]
 onto the intersection of a symmetric convex cone with an affine subspace. SDLS solves...

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...

QSDPNAL
 Referenced in 20 articles
[sw18799]
 constraints, a simple convex polyhedral set constraint, and a positive semidefinite cone constraint. A first...

cccp
 Referenced in 9 articles
[sw19308]
 package contains routines for solving convex optimization problems with cone constraints by means of interior...

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...

GORIC
 Referenced in 2 articles
[sw24569]
 widely applicable, forms (namely, closed convex cones) for multivariate normal linear models. It can examine...

Polyhedra
 Referenced in 7 articles
[sw12128]
 representing polyhedra, cones, and fans. Many standard operations, such as intersections, duality, convex hulls...

pystif
 Referenced in 1 article
[sw28070]
 compute projections of highdimensional convex cones into lower dimensional subspaces. It works best with...

Convex.jl
 Referenced in 1 article
[sw27000]
 Convex.jl is a Julia package for Disciplined Convex Programming (DCP). Convex.jl makes it easy ... mixedinteger secondorder cone programs; dcpcompliant convex programs including secondorder cone programs...

ECOS
 Referenced in 30 articles
[sw12123]
 solving optimization problems with secondorder 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...

gfanlib
 Referenced in 3 articles
[sw15679]
 features of convex geometry through an interface to Gfanlib. It contains cones, polytopes and fans...

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 selfdual cones, and a set of functions for identification...