On convex relaxations for quadratically constrained quadratic programming
From MaRDI portal
Publication:1925792
DOI10.1007/S10107-012-0602-3zbMATH Open1267.90103OpenAlexW2022026988MaRDI QIDQ1925792FDOQ1925792
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
Cites Work
- Title not available (Why is that?)
- BARON: A general purpose global optimization software package
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Semidefinite Programming
- Convex Analysis
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Convex Relaxations of (0, 1)-Quadratic Programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Computable representations for convex hulls of low-dimensional quadratic forms
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- The MILP Road to MIQCP
- Global Optimization in Geometry — Circle Packing into the Square
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- On Nonconvex Quadratic Programming with Box Constraints
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- Branch-and-bound approaches to standard quadratic optimization problems
Cited In (64)
- A guide to conic optimisation and its applications
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints
- Title not available (Why is that?)
- Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations
- (Global) optimization: historical notes and recent developments
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Convex and concave envelopes: revisited and new perspectives
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- On conic QPCCs, conic QCQPs and completely positive programs
- An unconstrained convex programming approach to solving convex quadratic programming problems
- Convex envelopes of bivariate functions through the solution of KKT systems
- On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables
- An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
- Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces?
- Title not available (Why is that?)
- Adaptive computable approximation to cones of nonnegative quadratic functions
- Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms
- Non polyhedral convex envelopes for 1-convex functions
- Convex optimization approach to a single quadratically constrained quadratic minimization problem
- On the problem of packing spheres in a cube
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Solving Quadratic Programming by Cutting Planes
- A model for clustering data from heterogeneous dissimilarities
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
- On tackling reverse convex constraints for non-overlapping of unequal circles
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables
- On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
- An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- Convex quadratic and semidefinite programming relaxations in scheduling
- Title not available (Why is that?)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- On linear programming relaxations for solving polynomial programming problems
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Ideal formulations for constrained convex optimization problems with indicator variables
- Facets of a mixed-integer bilinear covering set with bounds on variables
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- On improving convex quadratic programming relaxation for the quadratic assignment problem
- Optimization under uncertainty and risk: quadratic and copositive approaches
- On convex relaxations of quadrilinear terms
- Exactness criteria for SDP-relaxations of quadratic extremum problems
- On convex envelopes for bivariate functions over polytopes
- A technique to derive the analytical form of convex envelopes for some bivariate functions
- On quadratic and complete quadratic problems of convex programming
- On convex quadratic programs with linear complementarity constraints
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- On solving convex quadratic semi-infinite programming probelms
- A time-triggered dimension reduction algorithm for the task assignment problem
- A binarisation heuristic for non-convex quadratic programming with box constraints
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Convex Relaxations of (0, 1)-Quadratic Programming 👍 👎
- A relaxation method for nonconvex quadratically constrained quadratic programs 👍 👎
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs 👍 👎
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs 👍 👎
- On quadratic and complete quadratic problems of convex programming 👍 👎
- A new convex relaxation for quadratically constrained quadratic programming 👍 👎
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation 👍 👎
- On linear conic relaxation of discrete quadratic programs 👍 👎
This page was built for publication: On convex relaxations for quadratically constrained quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1925792)
