Global solution of non-convex quadratically constrained quadratic programs
From MaRDI portal
Publication:4646675
DOI10.1080/10556788.2017.1350675zbMath1405.90094OpenAlexW2741502759MaRDI QIDQ4646675
Sourour Elloumi, Amélie Lambert
Publication date: 14 January 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2017.1350675
global optimizationexperimentsspatial branch-and-boundquadratic convex relaxationgeneral mixed integer quadratic programming
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (6)
A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program ⋮ A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity ⋮ Risk-allocation-based index tracking ⋮ Using general triangle inequalities within quadratic convex reformulation method ⋮ Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation ⋮ Compact mixed-integer programming formulations in quadratic optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- GLOMIQO: global mixed-integer quadratic optimizer
- Constraint propagation on quadratic constraints
- Handbook on semidefinite, conic and polynomial optimization
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Extending the QCR method to general mixed-integer programs
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- SCIP: solving constraint integer programs
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- A review of recent advances in global optimization
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- An algorithmic framework for convex mixed integer nonlinear programs
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Algorithms for bound constrained quadratic programming problems
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Primal-relaxed dual global optimization approach
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- Continuous quadratic programming formulations of optimization problems on graphs
- Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Pooling Problem: Alternate Formulations and Solution Methods
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- Linear Reformulations of Integer Quadratic Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- CSDP, A C library for semidefinite programming
- Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
- Mixed-integer nonlinear optimization
- An Algorithm for Separable Nonconvex Programming Problems
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Benchmarking optimization software with performance profiles.
This page was built for publication: Global solution of non-convex quadratically constrained quadratic programs
