On convex relaxations for quadratically constrained quadratic programming
From MaRDI portal
Publication:1925792
DOI10.1007/s10107-012-0602-3zbMath1267.90103OpenAlexW2022026988MaRDI QIDQ1925792
Publication date: 19 December 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0602-3
Related Items
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables, Non polyhedral convex envelopes for 1-convex functions, On conic QPCCs, conic QCQPs and completely positive programs, Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective, A model for clustering data from heterogeneous dissimilarities, Strong formulations for quadratic optimization with M-matrices and indicator variables, RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, On linear programming relaxations for solving polynomial programming problems, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex, Lifted polymatroid inequalities for mean-risk optimization with indicator variables, Optimization under uncertainty and risk: quadratic and copositive approaches, Facets of a mixed-integer bilinear covering set with bounds on variables, (Global) optimization: historical notes and recent developments, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Representing quadratically constrained quadratic programs as generalized copositive programs, Submodularity in Conic Quadratic Mixed 0–1 Optimization, Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program, On convex envelopes for bivariate functions over polytopes, Convex and concave envelopes: revisited and new perspectives, Solving Quadratic Programming by Cutting Planes, A guide to conic optimisation and its applications, A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems, A technique to derive the analytical form of convex envelopes for some bivariate functions, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes, Convex envelopes of bivariate functions through the solution of KKT systems, Adaptive computable approximation to cones of nonnegative quadratic functions, Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization, On the problem of packing spheres in a cube, On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming, Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces?, An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices, A binarisation heuristic for non-convex quadratic programming with box constraints, On tackling reverse convex constraints for non-overlapping of unequal circles, An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs, An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs, A time-triggered dimension reduction algorithm for the task assignment problem, Ideal formulations for constrained convex optimization problems with indicator variables
Uses Software
Cites Work
- Unnamed Item
- Branch-and-bound approaches to standard quadratic optimization problems
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- BARON: A general purpose global optimization software package
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Computable representations for convex hulls of low-dimensional quadratic forms
- The MILP Road to MIQCP
- On Nonconvex Quadratic Programming with Box Constraints
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Convex Relaxations of (0, 1)-Quadratic Programming
- Semidefinite Programming
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Global Optimization in Geometry — Circle Packing into the Square
- Convex Analysis
