• Qhull

  • Referenced in 294 articles [sw04419]
  • point set P is the smallest convex set that contains P. If P is finite ... convex hull as a list of facets. Each facet has a set of vertices ... set of neighboring facets, and a halfspace. A halfspace is defined by a unit normal ... planes exclude all output vertices. See Imprecise convex hulls.Qhull may be used for the Delaunay...
  • PORTA

  • Referenced in 116 articles [sw04869]
  • either given as the convex hull of a set of points plus (possibly) the convex...
  • fminsearch

  • Referenced in 251 articles [sw07467]
  • family of strictly convex functions in two dimensions and a set of initial conditions ... minimizer for a more specialized class of convex functions in two dimensions...
  • cdd

  • Referenced in 110 articles [sw00114]
  • Minkowski sum of the convex hull of a finite set of points and the nonnegative...
  • PALP

  • Referenced in 65 articles [sw00672]
  • lattice points in the convex hull of a given set of points. In addition, there...
  • Hull

  • Referenced in 76 articles [sw11670]
  • program that computes the convex hull of a point set in general (but small!) dimension ... list of facets of the convex hull of the points, each facet presented...
  • LINGO

  • Referenced in 292 articles [sw04942]
  • make building and solving Linear, Nonlinear (convex & nonconvex/Global), Quadratic, Quadratically Constrained, Second Order Cone, Stochastic ... building and editing problems, and a set of fast built-in solvers...
  • QSDPNAL

  • Referenced in 22 articles [sw18799]
  • equality and inequality constraints, a simple convex polyhedral set constraint, and a positive semidefinite cone...
  • SCALCG

  • Referenced in 100 articles [sw08453]
  • strongly convex functions, the algorithm is global convergent. Preliminary computational results, for a set consisting...
  • Convex

  • Referenced in 32 articles [sw07770]
  • well as ”affine” convex geometry. In the affine setting, the basic objects are polyhedra, which ... Polyhedra can also be described as the convex hull of finitely many points and rays ... also called a polytope. In the Convex package, polyhedra are represented by the type POLYHEDRON ... POLYHEDRON are convhull and intersection. The linear setting is based on cones, which are intersections...
  • qpOASES

  • Referenced in 64 articles [sw05107]
  • implementation of the recently proposed online active set strategy (see [Ferreau, 2006], [Ferreau ... solving semi-definite, ill-posed or degenerated convex...
  • TFOCS

  • Referenced in 116 articles [sw12839]
  • Solvers. TFOCS (pronounced tee-fox) provides a set of Matlab templates, or building blocks, that ... efficient, customized solvers for a variety of convex models, including in particular those employed...
  • 2D triangulations

  • Referenced in 36 articles [sw11159]
  • triangulations for point sets two dimensions. Any CGAL triangulation covers the convex hull ... triangulations. Regular triangulations are also provided for sets of weighted points. Delaunay and regular triangulations...
  • LSSOL

  • Referenced in 17 articles [sw07785]
  • squares and convex quadratic programming. It uses a two-phase active-set method. Two main ... features are its exploitation of convexity and treatment of singularity. LSSOL may also be used ... feasible point with respect to a set of linear inequality constraints. LSSOL treats all matrices...
  • QPOPT

  • Referenced in 17 articles [sw07859]
  • linear least-squares and convex quadratic programming. QPOPT is a set of Fortran 77 subroutines ... set of linear equalities and inequalities. If the quadratic function is convex (i.e., the Hessian ... global minimizer. If the quadratic is non-convex (i.e., the Hessian is indefinite), the solution ... dead-point. A two-phase active-set method is used. The first phase minimizes...
  • FiOrdOs

  • Referenced in 6 articles [sw06277]
  • parametric convex programs with a quadratic cost and with a feasible set being ... intersection of (i) a simple convex set for which a projection can be evaluated...
  • archetypes

  • Referenced in 11 articles [sw06782]
  • represent observations in a multivariate data set as convex combinations of extremal points. This approach...
  • CalCS

  • Referenced in 6 articles [sw13098]
  • support conflict-driven learning. Moreover, whenever non-convex constraints are produced from Boolean reasoning ... that generates conservative approximations of the original set ... constraints by using geometric properties of convex sets and supporting hyperplanes. We validate CalCS...
  • isotone

  • Referenced in 31 articles [sw20811]
  • Pool-adjacent-violators algorithm (PAVA) and active set methods. In this paper we give ... violators algorithm (PAVA) to minimize a separable convex function with simple chain constraints. Besides ... convex programming problems with linear constraints we the develop a primal active set method...
  • ACCPM

  • Referenced in 59 articles [sw06707]
  • package for solving large scale convex optimization problems. The code is an implementation ... analytic center of the current localization set. The projective algorithm is successfully applied for this...