• SDPT3

  • Referenced in 703 articles [sw04009]
  • linear matrix inequalities. It employs an infeasible primal-dual predictor-corrector path-following method, with...
  • cdd

  • Referenced in 115 articles [sw00114]
  • ANSI C) implementation of the Double Description Method [MRTT53] for generating all vertices (i.e. extreme ... linear inequalities: P = {x c R^d : Ax <= b } where is an real matrix ... efficient implementation of the double description method which is employed in cdd+. One useful feature ... problem which is to obtain a linear inequality representation of a convex polyhedron given...
  • SparseCoLO

  • Referenced in 12 articles [sw04768]
  • form Linear Optimization). SparseCoLO is a Matlab package for implementing the four conversion methods, proposed ... positive semidefinite matrix completion for an optimization problem with matrix inequalities satisfying a sparse chordal ... methods, two methods utilize the domain-space sparsity of a semidefinite matrix variable ... other two methods the range-space sparsity of a linear matrix inequality (LMI) constraint...
  • QL

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

  • Referenced in 29 articles [sw05130]
  • control can be formulated as “linear matrix inequality” (LMI) problems. Previously, efficient algorithms have been ... solve his control problem using LMI methods with very little effort. Applications of LMIs...
  • cddplus

  • Referenced in 13 articles [sw04443]
  • implementation of the Double Description Method of Motzkin et al. for generating all vertices ... 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...
  • reducedLP

  • Referenced in 12 articles [sw04821]
  • inequality constraints Consider solving a linear program in standard form where the constraint matrix ... iteration of typical primal-dual interior-point methods on such problems...
  • GpoSolver

  • Referenced in 2 articles [sw15713]
  • successful methods for solving such problems is based on convex linear matrix inequality (LMI) relaxations...
  • 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 ... remain small. Here, the dual Schur complement method requires the projected Hessian to be positive ... method is not appropriate for all QPs. While the Schur complement approach to linear algebra...
  • SQOPT

  • Referenced in 18 articles [sw07860]
  • 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 ... given vector x. SQOPT uses stable numerical methods throughout and includes a reliable basis package ... maintaining sparse LU factors of the basis matrix), a practical anti-degeneracy procedure, scaling...
  • 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 ... trust-region subproblem using the conjugate gradient method for a new iterate. At times...
  • TPtool

  • Referenced in 6 articles [sw11769]
  • neural networks or fuzzy logic based methods, or as a result of a black ... convex polytopic forms, upon which LMI (Linear Matrix Inequality) based multi-objective control design techniques...
  • QSCMVN

  • Referenced in 2 articles [sw32365]
  • method used is similar to the method used by the Fortran MVNDST software ... specified by a set of linear inequalities in the form a < c*x < b, where ... vectors and c is an mxn matrix. QSCMVNV is a vectorized version of this software...
  • PermonQP

  • Referenced in 4 articles [sw16718]
  • unconstrained QP problems (i.e. linear systems with a positive semidefinite matrix) or equality constrained ones ... matrix. PermonQP capabilities can be further extended by using PermonIneq (algorithms for solution of inequality ... constrained problems) and/or PermonFLLOP (FETI domain decomposition methods). The PermonQP package extends the PETSc software...
  • ADOL-C

  • Referenced in 249 articles [sw00019]
  • ADOL-C: Automatic Differentiation of C/C++. We present...
  • ANSYS

  • Referenced in 704 articles [sw00044]
  • ANSYS offers a comprehensive software suite that spans...
  • ACL2

  • Referenced in 283 articles [sw00060]
  • ACL2 is both a programming language in which...
  • AXIOM

  • Referenced in 173 articles [sw00063]
  • Axiom is a general purpose Computer Algebra system...
  • BARON

  • Referenced in 354 articles [sw00066]
  • BARON is a computational system for solving nonconvex...