Global solution of non-convex quadratically constrained quadratic programs
From MaRDI portal
Recommendations
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- An efficient method for non-convex QCQP problems
- Extending the QCR method to general mixed-integer programs
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
Cites work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A polyhedral branch-and-cut approach to global optimization
- A review of recent advances in global optimization
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Algorithms for bound constrained quadratic programming problems
- An Algorithm for Separable Nonconvex Programming Problems
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Benchmarking optimization software with performance profiles.
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions
- Constraint propagation on quadratic constraints
- Continuous quadratic programming formulations of optimization problems on graphs
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- CSDP, A C library for semidefinite programming
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Extending the QCR method to general mixed-integer programs
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Globally solving nonconvex quadratic programming problems via completely positive programming
- GLOMIQO: global mixed-integer quadratic optimizer
- Handbook on semidefinite, conic and polynomial optimization
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3335677 (Why is no real title available?)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Linear Reformulations of Integer Quadratic Programs
- Mixed-integer nonlinear optimization
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Pooling problem: alternate formulations and solution methods
- Primal-relaxed dual global optimization approach
- SCIP: solving constraint integer programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(25)- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- Global optimal solution to quadratic discrete programming problem with inequality constraints
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Compact mixed-integer programming formulations in quadratic optimization
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- Extending a CIP framework to solve MIQCPs
- GLOMIQO: global mixed-integer quadratic optimizer
- scientific article; zbMATH DE number 1051015 (Why is no real title available?)
- Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
- 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
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
- Risk-allocation-based index tracking
- Using general triangle inequalities within quadratic convex reformulation method
- A tight compact quadratically constrained convex relaxation of the optimal power flow problem
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints
- Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs
- Impact of domain reduction techniques in polynomial optimization: a computational study
- Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints
- Global solution of quadratic problems using interval methods and convex relaxations
- Mixed integer quadratically constrained quadratic programming for neural network Lipschitz constant computation
Describes a project that uses
Uses Software
This page was built for publication: Global solution of non-convex quadratically constrained quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4646675)
