
Bonmin
 Referenced in 185 articles
[sw04766]
 mixed integer nonlinear problems that exhibit convex continuous relaxations, on which the experiments are carried...

sparsenet
 Referenced in 76 articles
[sw19133]
 purpose, along with a variety of convexrelaxation algorithms for finding good solutions. We pursue...

libMC
 Referenced in 43 articles
[sw06615]
 automatic generation of convex and concave relaxations of a given factorable function, a recursive procedure ... calculates enclosures as well as convex and concave relaxations recursively for each of these intermediate ... McCormick relaxation techniques [3]. Because McCormick relaxations are generally nonsmooth, subgradients (as opposed ... with each elementary operation of convex and concave relaxation, additional variables are introduced which store...

pottslab
 Referenced in 11 articles
[sw14425]
 methods based on graph cuts and convex relaxations of the Potts model which are presently ... that of graph cuts and the convex relaxation strategies, and we do not need...

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

SNLSDP
 Referenced in 37 articles
[sw05127]
 first solves an SDP relaxation (with regularization) of the nonconvex minimization problem...

ACCPM
 Referenced in 59 articles
[sw06707]
 package for solving large scale convex optimization problems. The code is an implementation ... cutting plane method. Instead of solving every relaxed master problem to optimality...

MINOTAUR
 Referenced in 18 articles
[sw06268]
 problems. We study methods for building polyhedral relaxations of multilinear terms that arise in nonconvex ... more compact than the convex hull formulation, but yields tighter relaxations than the standard McCormick...

NCVX
 Referenced in 3 articles
[sw24075]
 convex set. The heuristics, which employ convex relaxations, convex restrictions, local neighbour search methods...

DIFFRAC
 Referenced in 4 articles
[sw23902]
 discriminative cost function and a convex relaxation of a combinatorial op timization problem. The large...

PhaseMax
 Referenced in 15 articles
[sw24954]
 call PhaseMax. Unlike other convex methods that use semidefinite relaxation and lift the phase retrieval...

picasso
 Referenced in 4 articles
[sw20406]
 Computation is handled by multistage convex relaxation and the PathwIse CAlibrated Sparse Shooting algOrithm...

AlphaECP
 Referenced in 45 articles
[sw04940]
 plane method which was originally given for convex NLP problems (Kelley, 1960). The method requires ... feasibility or only to an integer relaxed solution in intermediate iterations. This makes ... Pörn R. (2002). Solving PseudoConvex Mixed Integer Optimization Problems by Cutting Plane Techniques. Optimization...

QPsimplex
 Referenced in 3 articles
[sw31751]
 necessary for the efficient solution of convex relaxations repeatedly at the nodes of the search ... simplexbased quadratic programming algorithms to solve convex as well as discrete instances and compare...

OPF
 Referenced in 3 articles
[sw18724]
 This solver aims to solve a convex relaxation for a largescale Optimal Power Flow...

Alpine.jl
 Referenced in 1 article
[sw34677]
 stage approach to strengthen piecewise convex relaxations for mixedinteger nonlinear programs (MINLP) with multi ... literature), we construct sparser partitions yet tighter relaxations by iteratively partitioning the variable domains ... polyhedral cutting plane methods to handle convex relaxations of higherorder monomial terms...

ADMBB
 Referenced in 1 article
[sw31752]
 based on alternative direction method and convex relaxation. We consider a quadratic program with ... subject to linear and convex quadratic constraints that covers many applications and is known...

ConicBundle
 Referenced in 12 articles
[sw05118]
 convex functions that are given by first order oracles or arise from Lagrangean relaxation...

ConvexRelaxationRungeKutta
 Referenced in 1 article
[sw34462]
 ConvexRelaxationRungeKutta: Relaxation RungeKutta Methods for Convex Functionals. Relaxation RungeKutta methods are modifications ... respect to any convex functional by the addition of a relaxation parameter that multiplies...

RRK_rr
 Referenced in 4 articles
[sw34461]
 Relaxation RungeKutta methods are modifications of RungeKutta methods that enforce conservation, dissipation ... respect to any convex functional by the addition of a relaxation parameter that multiplies...