
TVAL3
 Referenced in 15 articles
[sw08575]
 optimization problems (chiefly but not necessarily convex programs) with a particular structure. The algorithm effectively...

QSDPNAL
 Referenced in 17 articles
[sw18799]
 phase augmented Lagrangian method for convex quadratic semidefinite programming. In this paper, we present ... method, called QSDPNAL, for solving convex quadratic semidefinite programming (QSDP) problems with constraints consisting ... linear equality and inequality constraints, a simple convex polyhedral set constraint, and a positive semidefinite...

LSSOL
 Referenced in 17 articles
[sw07785]
 linearly constrained leastsquares and convex quadratic programming. It uses a twophase active ... convexity and treatment of singularity. LSSOL may also be used for linear programming...

L1MAGIC
 Referenced in 18 articles
[sw12430]
 MATLAB routines for solving the convex optimization programs central to compressive sampling. The algorithms...

QPOPT
 Referenced in 16 articles
[sw07859]
 constrained linear leastsquares and convex quadratic programming. QPOPT is a set of Fortran ... QPOPT may also be used for linear programming and for finding a feasible point ... inequalities. If the quadratic function is convex (i.e., the Hessian is positive definite or positive...

QPSchur
 Referenced in 16 articles
[sw06918]
 method for largescale and structured convex quadratic programming. We describe an activeset, dual...

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

TILOS
 Referenced in 8 articles
[sw11680]
 TILOS: A posynomial programming approach to transistor sizing. A new transistor sizing algorithm, which couples ... synchronous timing analysis with convex optimization techniques, is presented ... following three programs is shown to be convex: 1) Minimize A subject ... particular class of functions called posynomials. Convex programs have many pleasant properties, and chief among...

SCPIP
 Referenced in 7 articles
[sw11373]
 reliable implementation of convex programming methods in an industrial environment. Convex approximation methods like ... classical approaches of mathematical programming is that at an iteration point a local model ... current iteration point. The first versions of convex approximation methods used all a dual approach...

cdd
 Referenced in 104 articles
[sw00114]
 program cdd+ (cdd, respectively) is a C++ (ANSI C) implementation of the Double Description Method ... 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 ... functions, cdd/cdd+ can solve the general linear programming (LP) problem to maximize (or minimize...

DISNEL
 Referenced in 5 articles
[sw00207]
 rely on nonsmooth techniques.\parThe general nonlinear program is solved by a method ... linearization method (1983; Zbl. 533.49024)]; convex programs do not assume differentiability of functions ... ellipsoids can be constructed by solving convex programs of a special form...

iOptimize
 Referenced in 4 articles
[sw20377]
 Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior ... barrier solver version 6.0.0.106), iOptimize solves convex quadratic programming problems, convex quadratically ... constrained quadratic programming problems, and general convex programming problems in fewer iterations. Moreover, several problems...

LSSVMlab
 Referenced in 23 articles
[sw07367]
 methods one solves convex optimization problems, typically quadratic programs. Least Squares Support Vector Machines...

FiOrdOs
 Referenced in 6 articles
[sw06277]
 firstorder methods for parametric convex programs with a quadratic cost and with a feasible ... being the intersection of (i) a simple convex set for which a projection...

DCCP
 Referenced in 3 articles
[sw14722]
 Disciplined ConvexConcave Programming. In this paper we introduce disciplined convexconcave programming (DCCP ... which combines the ideas of disciplined convex programming (DCP) with convexconcave programming (CCP). Convex ... concave programming is an organized heuristic for solving nonconvex problems that involve objective and constraint ... improvements over previously published work on convexconcave programming, specifically the handling of domains...

CGAL
 Referenced in 319 articles
[sw00118]
 approximation of ridges and umbilics), alpha shapes, convex hull algorithms ... solver for linear and quadratic programs. It further offers interfaces to third party software such...

NewtonKKTqp
 Referenced in 9 articles
[sw04820]
 case of primaldual algorithms for linear programming) search directions for the “primal” variables ... adapted from previously proposed algorithms for convex quadratic programming and general nonlinear programming. First, inspired...

CalCS
 Referenced in 5 articles
[sw13098]
 fundamental results from the theory of convex programming to realize a satisfiability modulo theory ... support conflictdriven learning. Moreover, whenever nonconvex constraints are produced from Boolean reasoning...

CMUIBM
 Referenced in 11 articles
[sw13495]
 solving mixedinteger nonlinear programs (MINLP) with convex relaxation. The main objectives of this effort...

GGPLAB
 Referenced in 14 articles
[sw04344]
 paper A Tutorial on Geometric Programming, and the book Convex Optimization.GGPLAB consists ofGPCVX, a primal...