Computable representations for convex hulls of low-dimensional quadratic forms
From MaRDI portal
Publication:2638365
DOI10.1007/S10107-010-0355-9zbMath1198.90311OpenAlexW1969807530MaRDI QIDQ2638365
Kurt M. Anstreicher, Samuel Burer
Publication date: 16 September 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.3975
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (57)
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods ⋮ Tightening a copositive relaxation for standard quadratic optimization problems ⋮ Non polyhedral convex envelopes for 1-convex functions ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Deriving convex hulls through lifting and projection ⋮ On the copositive representation of binary and continuous nonconvex quadratic programs ⋮ Quadratic programs with hollows ⋮ On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ Interplay of non-convex quadratically constrained problems with adjustable robust optimization ⋮ A survey of hidden convex optimization ⋮ A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables ⋮ Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations ⋮ On convex relaxations for quadratically constrained quadratic programming ⋮ \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables ⋮ Copositivity and constrained fractional quadratic problems ⋮ Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex ⋮ Optimization under uncertainty and risk: quadratic and copositive approaches ⋮ (Global) optimization: historical notes and recent developments ⋮ Convex hull results on quadratic programs with non-intersecting constraints ⋮ Separating doubly nonnegative and completely positive matrices ⋮ Separation and relaxation for cones of quadratic forms ⋮ Copositive optimization -- recent developments and applications ⋮ New bounds for nonconvex quadratically constrained quadratic programming ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Unbounded convex sets for non-convex mixed-integer quadratic programming ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program ⋮ On convex envelopes for bivariate functions over polytopes ⋮ New approximations for the cone of copositive matrices and its dual ⋮ Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods ⋮ Exploiting partial correlations in distributionally robust optimization ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ Extended formulations for convex envelopes ⋮ A guide to conic optimisation and its applications ⋮ Reducing Conservatism in Robust Optimization ⋮ A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties ⋮ Valid inequalities for quadratic optimisation with domain constraints ⋮ A new framework to relax composite functions in nonlinear programs ⋮ A survey of adjustable robust optimization ⋮ How to convexify the intersection of a second order cone and a nonconvex quadratic ⋮ A technique to derive the analytical form of convex envelopes for some bivariate functions ⋮ 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 ⋮ Burer's key assumption for semidefinite and doubly nonnegative relaxations ⋮ Adaptive computable approximation to cones of nonnegative quadratic functions ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ Building a completely positive factorization ⋮ Copositive Programming ⋮ A binarisation heuristic for non-convex quadratic programming with box constraints ⋮ An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation ⋮ Quadratic optimization with switching variables: the convex hull for \(n=2\) ⋮ Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks ⋮ Convex hull representations for bounded products of variables ⋮ Convex envelopes for ray-concave functions ⋮ A gentle, geometric introduction to copositive optimization
Uses Software
Cites Work
- Branch-and-bound approaches to standard quadratic optimization problems
- Characterization of completely positive graphs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A new reformulation-linearization technique for bilinear programming problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Approximating quadratic programming with bound and quadratic constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- BARON: A general purpose global optimization software package
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- The Convex Envelope of (n–1)-Convex Functions
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On copositive programming and standard quadratic optimization problems
This page was built for publication: Computable representations for convex hulls of low-dimensional quadratic forms
