• # cdd

• Referenced in 115 articles [sw00114]
• linear inequalities: P = {x c R^d : Ax <= b } where is an real matrix ... problem which is to obtain a linear inequality representation of a convex polyhedron given...
• # SparseCoLO

• Referenced in 12 articles [sw04768]
• SparseCoLO (Conversion Methods for SPARSE COnic-form Linear Optimization). SparseCoLO is a Matlab package ... positive semidefinite matrix completion for an optimization problem with matrix inequalities satisfying a sparse chordal ... including both primal and dual form of linear, semidefinite, second-order cone programs with equality/inequality ... range-space sparsity of a linear matrix inequality (LMI) constraint of the given problem. SparseCoLO...
• # SPECTRA

• Referenced in 8 articles [sw17619]
• SPECTRA -a Maple library for solving linear matrix inequalities in exact arithmetic, This document briefly ... Tools of Real Algebra. It solves linear matrix inequalities in exact arithmetic...
• # cddplus

• Referenced in 13 articles [sw04443]
• given by a system of linear inequalities: P = { x : A x <= b } where ... real matrix and b is a real m dimensional vector. The program can be used ... move back and forth between an inequality representation and a generator (i.e. vertex ... with cdd+. Also, cdd+ can solve a linear programming problem, i.e. a problem of maximizing...
• # Vass

• Referenced in 1 article [sw34696]
• algebra_ext.v: Quantifier elimination principle for linear inequalities; matrix_ext.v: Farkas’ lemma; cone.v: Elementary theory...
• # QL

• Referenced in 16 articles [sw12450]
• quadratic programming problems subject to linear equality and inequality constraints by the primal-dual method ... available Cholesky decomposition of the objective function matrix can be provided by the user. Bounds...
• # NlcOptim

• Referenced in 2 articles [sw31431]
• objective and constraint functions. Linear or nonlinear equality and inequality constraints are allowed. It accepts ... input parameters as a constrained matrix...
• # QPSchur

• Referenced in 16 articles [sw06918]
• abstracted away behind a fixed KKT matrix called $K_{o}$ and other problem matrices, which ... Updates to the working set of active inequality constraints are facilitated using a dense Schur ... While the Schur complement approach to linear algebra is very flexible with respect to allowing...
• # LCOBYQA

• Referenced in 9 articles [sw10964]
• whose derivatives are unavailable, subject to linear inequality constraints. The algorithm is based ... change to the second derivative matrix of the model. The model is then minimized...
• # SQOPT

• Referenced in 18 articles [sw07860]
• linear equalities and inequalities. SQOPT uses a two-phase, active-set, reduced-Hessian method ... freedom. SQOPT is primarily intended for large linear and quadratic problems with sparse constraint matrices ... maintaining sparse LU factors of the basis matrix), a practical anti-degeneracy procedure, scaling...