
LOQO
 Referenced in 206 articles
[sw02212]
 primaldual interiorpoint method for general nonlinear programming. We focus in this paper mainly ... brief mention of the extensions to convex and general nonlinear programming, since a detailed paper...

cdd
 Referenced in 112 articles
[sw00114]
 points) and extreme rays of a general convex polyhedron given by a system of linear ... given as the Minkowski sum of the convex hull of a finite set of points ... these basic functions, cdd/cdd+ can solve the general linear programming (LP) problem to maximize...

PENNON
 Referenced in 105 articles
[sw04336]
 convex nonlinear and semidefinite programming (NLPSDP). The algorithm used in PENNON is a generalized ... Zibulevsky for convex NLP problems. We present generalization of this algorithm to convex...

isotone
 Referenced in 31 articles
[sw20811]
 generalized version of the pooladjacentviolators algorithm (PAVA) to minimize a separable convex function ... with simple chain constraints. Besides of general convex functions we extend existing PAVA implementations...

Hull
 Referenced in 76 articles
[sw11670]
 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...

alphahull
 Referenced in 16 articles
[sw07945]
 package alphahull: Generalization of the convex hull of a sample of points in the plane ... concepts of alphashape and alphaconvex hull generalize the definition of the convex hull...

PESTO
 Referenced in 30 articles
[sw20864]
 worstcase to solving a convex semidefinite program, generalizing previous works on performance estimation...

Sdpsol
 Referenced in 18 articles
[sw00840]
 LMITOOL and YALMIP. The much newer general purpose convex optimization package CVX serves the same...

cddplus
 Referenced in 11 articles
[sw04443]
 points) and extreme rays of a general convex polyhedron in R^d given...

SpicyMKL
 Referenced in 8 articles
[sw14765]
 called SpicyMKL, which is applicable to general convex loss functions and general types of regularization...

ZQPCVX
 Referenced in 34 articles
[sw08459]
 convex quadratic programming are considered. A pathological example shows that the faster ... provided for general use a Fortran subroutine [”ZQPCVX: a Fortran subroutine for convex, quadratic programming ... Fletcher, ”A Fortran subroutine for general quadratic programming”, Report AERER 6370, Harwell ... Idnani is very suitable in practice for convex quadratic programming calculations...

HANSO
 Referenced in 15 articles
[sw05271]
 gradient sampling methods. For general unconstrained minimization: convex or nonconvex, smooth or nonsmooth, including BFGS...

iOptimize
 Referenced in 4 articles
[sw20377]
 Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior ... quadratically constrained quadratic programming problems, and general convex programming problems in fewer iterations. Moreover, several ... iOptimize detects infeasibility more reliably than the general nonlinear solvers Ipopt (version 3.9.2) and Knitro...

AlphaECP
 Referenced in 45 articles
[sw04940]
 general MINLP problems and global optimal solutions can be ensured for pseudoconvex MINLP problems...

OBOE
 Referenced in 6 articles
[sw04713]
 open source software for general convex optimization. It assumes that a usermade code, thereafter...

ACGSSV
 Referenced in 9 articles
[sw20836]
 algorithm is given both for uniformly convex and general nonlinear functions under the exact...

SPG
 Referenced in 74 articles
[sw00897]
 projected gradient algorithm for solving largescale convexconstrained optimization problems. It combines the classical ... substantially more efficient than existing generalpurpose software on problems for which projections...

Normaliz
 Referenced in 154 articles
[sw00630]
 computes the defining hyperplanes, and vice versa), convex hulls, a triangulation of a vector ... grading (for example, for rational polytopes), generalized (or weighted) Ehrhart series and Lebesgue integrals...

COBS
 Referenced in 28 articles
[sw08988]
 smoothing techniques generally have a difficult time accommodating qualitative constraints like monotonicity, convexity or boundary ... optimal rate of convergence. Several options and generalizations are included in COBS: it can handle...

libMC
 Referenced in 45 articles
[sw06615]
 Then, libMC calculates enclosures as well as convex and concave relaxations recursively for each ... relaxation techniques [3]. Because McCormick relaxations are generally nonsmooth, subgradients (as opposed to gradients ... forward mode, with each elementary operation of convex and concave relaxation, additional variables are introduced...