Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
From MaRDI portal
Publication:1621692
DOI10.1007/s12532-018-0133-xzbMath1400.90239OpenAlexW2790253958WikidataQ130197918 ScholiaQ130197918MaRDI QIDQ1621692
Pierre Bonami, Jeff Linderoth, Oktay Günlük
Publication date: 9 November 2018
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-018-0133-x
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Cutting Plane Generation through Sparse Principal Component Analysis, Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, Skyport location problem for urban air mobility system, Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA, A computational study on QP problems with general linear constraints, SDP-based branch-and-bound for non-convex quadratic integer optimization, (Global) optimization: historical notes and recent developments, A distributionally robust optimization approach for two-stage facility location problems, On the impact of running intersection inequalities for globally solving polynomial optimization problems, Optimal design of line replaceable units, Outer-product-free sets for polynomial optimization and oracle-based cuts, Data-driven decision model based on local two-stage weighted ensemble learning, Using general triangle inequalities within quadratic convex reformulation method, Solving Quadratic Programming by Cutting Planes, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, The Running Intersection Relaxation of the Multilinear Polytope, Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems, Volume computation for sparse Boolean quadric relaxations, Extended formulations for convex hulls of some bilinear functions, Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints, Compact mixed-integer programming formulations in quadratic optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- On cuts and matchings in planar graphs
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Total unimodularity and the Euler-subgraph problem
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Experiments in quadratic 0-1 programming
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A polyhedral branch-and-cut approach to global optimization
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- The cut polytope and the Boolean quadric polytope
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- On convex relaxations for quadratically constrained quadratic programming
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- Computable representations for convex hulls of low-dimensional quadratic forms
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Outline of an algorithm for integer solutions to linear programs
- On Nonconvex Quadratic Programming with Box Constraints
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- On the cut polytope
- On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
- Edmonds polytopes and weakly hamiltonian graphs
- Introduction to global optimization.
- Benchmarking optimization software with performance profiles.
