• # convex_learning

• Referenced in 2 articles [sw32735]
• convex variational model for learning convolutional image atoms from incomplete data. A variational model ... Building on lifting and relaxation strategies, the proposed approach is convex and allows for simultaneous...
• # amodMC

• Referenced in 5 articles [sw06614]
• propagation of, in general nondifferentiable, McCormick relaxations [see, e.g., {it G. P. McCormick}, Math. Program ... derivative-based methods to possibly nondifferentiable convex and concave functions. The software package libMC [Mitsos ... performs the automatic propagation of the relaxation and of corresponding subgradients based on the principles...
• # ARock

• Referenced in 20 articles [sw16800]
• parallel computing since it reduces synchronization wait, relaxes communication bottleneck, and thus speeds up computing ... special cases of ARock for linear systems, convex optimization, and machine learning, as well...
• # extended-MIQCP

• Referenced in 9 articles [sw31776]
• Programm 103(2): 225–249, 2005). This relaxation is less economical, but its approximation quality ... only be used for MICQP problems with convex quadratic constraints. In this paper we show...
• # SHOT

• Referenced in 7 articles [sw15630]
• programming. A new deterministic algorithm for solving convex mixed-integer nonlinear programming (MINLP) problems ... sequence of linear or quadratic integer-relaxed subproblems are first solved to rapidly generate ... tight linear relaxation of the original MINLP problem. After an initial overestimated set has been ... algorithm converges to a global optimum for convex MINLP problems. The ESH algorithm is implemented...
• # SpeeDP

• Referenced in 4 articles [sw07003]
• consider low-rank semidefinite programming (LRSDP) relaxations of unconstrained ${-1,1}$ quadratic problems (or, equivalently ... that can be formulated as the non-convex nonlinear programming problem of minimizing a quadratic...
• # QCQP

• Referenced in 3 articles [sw27001]
• solving quadratically constrained quadratic programs (QCQPs) using relaxations and local search heuristics. Our heuristics ... CVXPY, a domain-specific language for convex optimization embedded in Python...
• # POS3POLY

• Referenced in 3 articles [sw09847]
• optimization with positive polynomials. Positive polynomials, relaxed to sum-of-squares in the multivariate case ... with positive polynomials as variables in a convex optimization problem. We present here the POS3POLY...
• # StdPooling-PolyAlgos

• Referenced in 5 articles [sw34823]
• hard subclass of non-convex quadratically-constrained optimization problems that commonly arises in process systems ... functions. We introduce dominant active topologies under relaxed flow availability to explicitly identify pooling problem...
• # Muriqui

• Referenced in 1 article [sw32925]
• Moreover, Muriqui can be applied to non-convex problems, without the guarantee of obtaining optimal ... Branch-and-Bound; Feasibility Pump; Diving heuristic; Relaxation Enforced Neighborhood Search; Integrality Gap Minimization Heuristic...
• # NLCertify

• Referenced in 4 articles [sw08786]
• using a hierarchy of semidefinite (SDP) relaxations, via an interface with the external SDPA solver ... resp. upper) estimators using concave maxima (resp. convex infima) of quadratic forms. In this...