• SHOT

  • Referenced in 22 articles [sw15630]
  • tight overestimated polyhedral set of the feasible set defined by linear and nonlinear constraints ... sequence of linear or quadratic integer-relaxed subproblems are first solved to rapidly generate ... original MINLP problem. After an initial overestimated set has been obtained the algorithm solves ... mixed-integer quadratic programming subproblems and refines the overestimated set by generating more supporting hyperplanes...
  • GPDT

  • Referenced in 47 articles [sw04803]
  • quadratic subproblem solution, the gradient updating, the working set selection, are systematically described and their...
  • NPSOL

  • Referenced in 147 articles [sw07420]
  • package for nonlinear programming. NPSOL is a set of Fortran 77 subroutines for minimizing ... direction is the solution of a QP subproblem. Bounds, linear constraints, and nonlinear constraints...
  • BLITZ

  • Referenced in 6 articles [sw37121]
  • optimization to a sequence of small subproblems, working set methods achieve fast convergence times ... working sets is limited, and implementations often resort to heuristics to determine subproblem size, makeup ... set algorithm accompanied by useful guarantees. Making no assumptions on data, our theory relates subproblem ... solvers in sequential, limited-memory, and distributed settings. BLITZ is not specific to l1-regularized...
  • MuShROOM

  • Referenced in 15 articles [sw12000]
  • arising nonconvex quadratic subproblems such as a new parametric active set method based on strong...
  • qpHPSC

  • Referenced in 15 articles [sw12001]
  • arising nonconvex quadratic subproblems such as a new parametric active set method based on strong...
  • CONLIN

  • Referenced in 47 articles [sw14151]
  • dual variables. Because each quadratic subproblem is restricted to the current subspace of non zero ... iterative process is performed with reduced sets of primal variables and dual variables. Furthermore...
  • EVPI

  • Referenced in 20 articles [sw02644]
  • which decomposes the original problem into a set of smaller linear programming problems ... alternatives for large problems. The Benders subproblems can be visualised as being attached...
  • ParaSCIP

  • Referenced in 32 articles [sw06292]
  • solvers as independently running processes to solve subproblems (nodes of the branching tree) locally. This ... unsolved instances from MIPLIB2003, a standard test set library for MIP solvers. For these computations...
  • SATe

  • Referenced in 3 articles [sw24610]
  • operations. The original data set is divided into smaller subproblems by a tree-based decomposition ... These subproblems are aligned and further merged for phylogenetic tree inference. The implementation developed ... this implementation uses the ”SATé-II fast” settings (but see the ”known issues” section below...
  • MERGEXPLAIN

  • Referenced in 2 articles [sw24976]
  • decompose a problem into a set of smaller independent subproblems. Our technique allows ... which is particularly helpful in MBD problem settings. An empirical evaluation on various benchmark problems...
  • ACM/EATCS

  • Referenced in 4 articles [sw03105]
  • test sets should also facilitate algorithm selection for applications by characterizing subproblems and the behavior...
  • QSDPNAL

  • Referenced in 33 articles [sw18799]
  • inequality constraints, a simple convex polyhedral set constraint, and a positive semidefinite cone constraint ... augmented Lagrangian method (ALM) wherein the inner subproblem in each iteration is solved via inexact...
  • MULKNAP

  • Referenced in 38 articles [sw06467]
  • Then, the problem is to determine the set of knapsacks to be purchased, as well ... Lagrangian multipliers obtained above for pruning subproblems, and at each terminal subproblem, we solve...
  • BaPCod

  • Referenced in 20 articles [sw09871]
  • method: the input is the set of constraints and variables ... underlying MIP solver to handle master and subproblem but the user can upload a specific...
  • FarRSA

  • Referenced in 1 article [sw25237]
  • method include: (i) an evolving set of indices corresponding to variables that are predicted ... nonzero at a solution; (ii) subproblems that only need to be solved in a reduced ... when the subspace explored by the current subproblem should be updated; and (v) a reduced ... set of model prediction problems with a Matlab implementation. Here, we introduce an enhanced subproblem...
  • Benders-squared

  • Referenced in 1 article [sw41052]
  • dual dynamic programming to the infinite-horizon setting: we explore a sequence of finite-horizon ... scenario subproblems. A computational study on a large set of randomly generated instances...
  • ISUD

  • Referenced in 13 articles [sw34491]
  • authors have studied the structure of the set partitioning polytope and proposed adaptations ... integral simplex using decomposition algorithm uses a subproblem to find a group of variables...
  • ESOLID

  • Referenced in 11 articles [sw15824]
  • demands of exact computation require a different set of algorithms and efficiency improvements than those ... error bounds, and lower-dimensional formulation of subproblems. ESOLID has been used for boundary evaluation...
  • LCOBYQA

  • Referenced in 9 articles [sw10964]
  • given function constructed from a set of interpolation points. LCOBYQA is iterative, at each iteration ... then minimized by a trust-region subproblem using the conjugate gradient method...