• LMI toolbox

• Referenced in 1468 articles [sw06383]
• Linear Matrix Inequalities (LMIs) and LMI techniques have emerged as powerful design tools in areas...

• SDPT3

• Referenced in 707 articles [sw04009]
• case of determinant maximization problems with linear matrix inequalities. It employs an infeasible primal-dual...

• GloptiPoly

• Referenced in 329 articles [sw04343]
• hierarchy of semidefinite programming (SDP), or linear matrix inequality (LMI) relaxations of the GPM, whose...

• LMIRank

• Referenced in 37 articles [sw04823]
• linear matrix inequality (LMI) problem is a well known type of convex feasibility problem that...

• LMITOOL

• Referenced in 30 articles [sw05130]
• control can be formulated as “linear matrix inequality” (LMI) problems. Previously, efficient algorithms have been...

• cdd

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

• ROLMIP

• Referenced in 19 articles [sw21158]
• constraints that are usually defined as Linear Matrix Inequalities (LMIs). The main objective of ROLMIP...

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

• SeDuMi Interface

• Referenced in 40 articles [sw41088]
• optimisation problems over Linear Matrix Constraints (LMCs). It includes both Inequalities (LMIs) and Equalities (LMEs...

• TPtool

• Referenced in 6 articles [sw11769]
• convex polytopic forms, upon which LMI (Linear Matrix Inequality) based multi-objective control design techniques...

• GpoSolver

• Referenced in 2 articles [sw15713]
• such problems is based on convex linear matrix inequality (LMI) relaxations. Software implementations of this...

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

• reducedLP

• Referenced in 12 articles [sw04821]
• inequality constraints Consider solving a linear program in standard form where the constraint matrix...

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