On the copositive representation of binary and continuous nonconvex quadratic programs
From MaRDI portal
Publication:2391001
DOI10.1007/S10107-008-0223-ZzbMATH Open1180.90234OpenAlexW2078600458MaRDI QIDQ2391001FDOQ2391001
Authors: Samuel Burer 
Publication date: 24 July 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0223-z
Recommendations
- Representing quadratically constrained quadratic programs as generalized copositive programs
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- Approximating non-convex quadratic programs by semidefinite and copositive programming
- On copositive programming and standard quadratic optimization problems
- Copositivity aspects of standard quadratic optimization problems
- Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
- Copositive realxation for genera quadratic programming
- scientific article; zbMATH DE number 223543
- On solvability of convex noncoercive quadratic programming problems
- Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming
Quadratic programming (90C20) Convex programming (90C25) Nonconvex programming, global optimization (90C26)
Cites Work
- Maximum stable set formulations and heuristics based on continuous optimization
- On the Shannon capacity of a graph
- Approximation of the stability number of a graph via copositive programming
- An adaptive linear approximation algorithm for copositive programs
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- On Cones of Nonnegative Quadratic Functions
- Maxima for Graphs and a New Proof of a Theorem of Turán
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Computable representations for convex hulls of low-dimensional quadratic forms
- On copositive programming and standard quadratic optimization problems
- A Copositive Programming Approach to Graph Partitioning
- Title not available (Why is that?)
- A PTAS for the minimization of polynomials of fixed degree over the simplex
Cited In (only showing first 100 items - show all)
- Correlation matrices, Clifford algebras, and completely positive semidefinite rank
- Two-stage stochastic standard quadratic optimization
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- Conic approximation to quadratic optimization with linear complementarity constraints
- Quadratic optimization over one first-order cone
- Quadratic optimization with switching variables: the convex hull for \(n=2\)
- Polyhedral approximations of the semidefinite cone and their application
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- Quadratic optimization over a polyhedral cone
- New bounds for nonconvex quadratically constrained quadratic programming
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- Completely positive and copositive program modelling for quadratic optimization problems
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Matrix relaxations in combinatorial optimization
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- A survey of hidden convex optimization
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- Completely positive tensor recovery with minimal nuclear value
- An efficient inexact ABCD method for least squares semidefinite programming
- Binary positive semidefinite matrices and associated integer polytopes
- Strong duality for general quadratic programs with quadratic equality constraints
- Robust quadratic programming with mixed-integer uncertainty
- Semidefinite approximations for quadratic programs over orthogonal matrices
- Continuous quadratic programming formulations of optimization problems on graphs
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- Completely positive semidefinite rank
- A polynomial-time interior-point method for circular cone programming based on kernel functions
- Solving Quadratic Programming by Cutting Planes
- A factorization method for completely positive matrices
- An exact completely positive programming formulation for the discrete ordered median problem: an extended version
- LP-based tractable subcones of the semidefinite plus nonnegative cone
- Cardinality constrained portfolio selection problem: a completely positive programming approach
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- Hermitian completely positive matrices
- An algorithm for determining copositive matrices
- Completely positive reformulations of polynomial optimization problems with linear constraints
- A fresh CP look at mixed-binary QPs: new formulations and relaxations
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- Quadratic optimization over a second-order cone with linear equality constraints
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
- A Newton-bracketing method for a simple conic optimization problem
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
- Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls
- Copositivity and sparsity relations using spectral properties
- Optimization under uncertainty and risk: quadratic and copositive approaches
- Copositive programming via semi-infinite optimization
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- On reduced semidefinite programs for second order moment bounds with applications
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- A new conic approach to semisupervised support vector machines
- A semidefinite algorithm for completely positive tensor decomposition
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
- On cones of nonnegative quartic forms
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
- The Maximum k-Colorable Subgraph Problem and Related Problems
- Foundations of set-semidefinite optimization
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
- Testing copositivity via mixed-integer linear programming
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- A note on Burer's copositive representation of mixed-binary QPs
- SPN completable graphs
- Can you cover your shadows?
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- On conic QPCCs, conic QCQPs and completely positive programs
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- An improved algorithm to test copositivity
- On the computational complexity of membership problems for the completely positive cone and its dual
- Quadratic factorization heuristics for copositive programming
- Geometry of the copositive and completely positive cones
- Conic relaxations for semi-supervised support vector machines
- Exceptional family and solvability of copositive complementarity problems
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Stochastic nonlinear resource allocation problem
- Distributionally robust mixed integer linear programs: persistency models with applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- On the set-semidefinite representation of nonconvex quadratic programs with cone constraints
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- Copositive optimization -- recent developments and applications
- Burer's key assumption for semidefinite and doubly nonnegative relaxations
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Computing the distance between the linear matrix pencil and the completely positive cone
- Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Chance constrained \(0-1\) quadratic programs using copulas
- On the stable solution of large scale problems over the doubly nonnegative cone
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
- Representing quadratically constrained quadratic programs as generalized copositive programs
Uses Software
This page was built for publication: On the copositive representation of binary and continuous nonconvex quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391001)
