• TVAL3

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

  • Referenced in 15 articles [sw12450]
  • Fortran Code for Convex Quadratic Programming. The Fortran subroutine QL solves strictly convex quadratic programming...
  • QSDP

  • Referenced in 44 articles [sw04726]
  • designed to solve a convex quadratic semide¯nite programming(QSDP) problem, possibly with...
  • LSSOL

  • Referenced in 17 articles [sw07785]
  • linearly constrained least-squares and convex quadratic programming. It uses a two-phase active ... convexity and treatment of singularity. LSSOL may also be used for linear programming...
  • PESTO

  • Referenced in 20 articles [sw20864]
  • worst-case to solving a convex semidefinite program, generalizing previous works on performance estimation...
  • QPOPT

  • Referenced in 17 articles [sw07859]
  • constrained linear least-squares 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 large-scale and structured convex quadratic programming. We describe an active-set, dual...
  • 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...
  • cdd

  • Referenced in 109 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...
  • 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...
  • 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...
  • LS-SVMlab

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

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

  • Referenced in 6 articles [sw22020]
  • properties. CVXR then applies signed disciplined convex programming (DCP) to verify the problem’s convexity...
  • FiOrdOs

  • Referenced in 6 articles [sw06277]
  • first-order 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...
  • CalCS

  • Referenced in 6 articles [sw13098]
  • fundamental results from the theory of convex programming to realize a satisfiability modulo theory ... support conflict-driven learning. Moreover, whenever non-convex constraints are produced from Boolean reasoning...
  • DCCP

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

  • Referenced in 6 articles [sw12637]
  • study of RPSALG algorithm for convex semi-infinite programming. The Remez penalty and smoothing algorithm ... methods for solving min-max convex semi-infinite programing problems, whose convergence was analyzed ... RPSALG for solving ordinary convex semi-infinite programming problems. Each iteration of RPSALG involves ... obtaining an approximate solution of some discretized convex problem, while the second one requires...
  • NewtonKKTqp

  • Referenced in 9 articles [sw04820]
  • case of primal-dual 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...