• Couenne

  • Referenced in 69 articles [sw04347]
  • package named couenne (Convex Over- and Under-ENvelopes for Non-linear Estimation) and used ... extensive tests on several combinations of BT and branching techniques on a set of publicly...
  • COBRA

  • Referenced in 9 articles [sw14858]
  • introduced. Instead of building a linear or convex optimized combination over a collection of basic...
  • AK-MCS

  • Referenced in 72 articles [sw18303]
  • Active learning reliability method combining Kriging and Monte Carlo Simulation. It is shown ... problems dealing with high non-linearity, non-differentiability, non-convex and non-connex domains...
  • CalCS

  • Referenced in 8 articles [sw13098]
  • linear convex constraints. Certain formal verification tasks require reasoning about Boolean combinations of non-linear ... solving of Boolean combinations of non-linear constraints that are convex. Our approach applies fundamental ... solver. Our solver, CalCS, uses a lazy combination of SAT and a theory solver...
  • FilMINT

  • Referenced in 52 articles [sw06197]
  • LP/NLP based branch-and-bound algorithm for convex MINLP optimization problems.” Comput. Chemical Engrg ... master mixed-integer linear program (MILP) by adding new linearizations at open nodes ... solution is found. The new solver, FilMINT, combines the MINTO branch-and-cut framework ... offer new suggestions for generating and managing linearizations that are shown to be efficient...
  • mixup

  • Referenced in 15 articles [sw35857]
  • mixup trains a neural network on convex combinations of pairs of examples and their labels ... regularizes the neural network to favor simple linear behavior in-between training examples. Our experiments...
  • ARAP++

  • Referenced in 4 articles [sw36689]
  • energy, we introduce a linear iterative scheme which employs convex combination weights and a fitting...
  • SIRF

  • Referenced in 4 articles [sw27454]
  • formulated as a convex optimization problem which minimizes a linear combination of a least-squares...
  • FourierMotzkin

  • Referenced in 2 articles [sw27120]
  • convex cone is finitely generated if it is the set of all nonnegative linear combinations ... fundamental theorem for cones states that a convex cone is polyhedral if and only...
  • SpicyMKL

  • Referenced in 9 articles [sw14765]
  • called SpicyMKL, which is applicable to general convex loss functions and general types of regularization ... proximal minimization method and converges super-linearly. The cost of inner minimization is roughly proportional ... when we aim for a sparse kernel combination, our algorithm scales well against increasing number...
  • FORCES NLP

  • Referenced in 4 articles [sw41780]
  • speed and robustness of embedded solvers for convex quadratic programs (QP) developed during the last ... blocks from nonlinear programming, combined with a structure-exploiting linear system solver, it is possible...
  • ASPIRE

  • Referenced in 2 articles [sw32496]
  • using cryo-EM. Our methods use a combination of tools from different areas of mathematics ... optimization (convex and non-convex), random matrix theory, signal and image processing, linear and nonlinear...
  • SPeeDI

  • Referenced in 8 articles [sw00896]
  • tool for polygonal hybrid systems Hybrid systems combining discrete and continuous dynamics arise as mathematical ... rectangular automata and hybrid automata with linear vector fields. Most implemented computational procedures resort ... backward) propagation of constraints, typically (unions of convex) polyhedra or ellipsoids. In general, these techniques...
  • UNAMALLA

  • Referenced in 7 articles [sw13144]
  • have different geometric properties which can be combined according the problem where they will ... which is often non convex, until a smooth and convex grid is obtained;using discrete ... grid generation processinvolves diverse subjects such as linear algebra, large scale optimization methods and computer...
  • REPOP

  • Referenced in 5 articles [sw41948]
  • synthesis of control policies for non-linear systems, and solution methods such as approximate dynamic ... optimal solution, by employing appropriate convex relaxations of the original problem. In this direction ... addition, we propose a convergent hierarchy which combines aspects from sum of squares and relative...
  • DDS

  • Referenced in 2 articles [sw36808]
  • current version of DDS accepts every combination of the following function/set constraints: (1) symmetric cones ... dimensional convex sets defined as the epigraphs of univariate convex functions (including as special cases ... case minimization of nuclear norm over a linear subspace); (6) vector relative entropy; (7) epigraphs...
  • ANSYS

  • Referenced in 704 articles [sw00044]
  • ANSYS offers a comprehensive software suite that spans...
  • BARON

  • Referenced in 357 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • CGAL

  • Referenced in 396 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • Cinderella

  • Referenced in 153 articles [sw00127]
  • An Interactive Geometry Software. Besides support for dynamic...