Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints

Cites Work

Unnamed Item
Unnamed Item
A Modeling Language for Mathematical Programming
RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
Semidefinite relaxations for non-convex quadratic mixed-integer programming
Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
Exact conic programming relaxations for a class of convex polynomial cone programs
A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
Semidefinite programming relaxations for semialgebraic problems
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
A hybrid LP/NLP paradigm for global optimization relaxations
Power transmission network expansion planning: a semidefinite programming branch-and-bound approach
A reformulation-convexification approach for solving nonconvex quadratic programming problems
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
Machine learning for combinatorial optimization: a methodological tour d'horizon
Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
QPLIB: a library of quadratic programming instances
On learning and branching: a survey
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
Computational advances in polynomial optimization: RAPOSa, a freely available global solver
Global Optimization with Polynomials and the Problem of Moments
MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
BiqCrunch
Branching and bounds tighteningtechniques for non-convex MINLP
An approach to obtaining global extremums in polynomial mathematical programming problems
Solving Quadratic Programming by Cutting Planes
Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
Global solution of non-convex quadratically constrained quadratic programs
SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
Random forests
Benchmarking optimization software with performance profiles.
JuMP 1.0: recent improvements to a modeling language for mathematical optimization
Learning for Spatial Branching: An Algorithm Selection Approach

This page was built for publication: Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints