On the copositive representation of binary and continuous nonconvex quadratic programs
From MaRDI portal
Publication:2391001
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
Cites work
- scientific article; zbMATH DE number 3431982 (Why is no real title available?)
- A Copositive Programming Approach to Graph Partitioning
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- An adaptive linear approximation algorithm for copositive programs
- Approximation of the stability number of a graph via copositive programming
- Computable representations for convex hulls of low-dimensional quadratic forms
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Maximum stable set formulations and heuristics based on continuous optimization
- On Cones of Nonnegative Quadratic Functions
- On copositive programming and standard quadratic optimization problems
- On the Shannon capacity of a graph
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
Cited in
(only showing first 100 items - show all)- A simplified completely positive reformulation for binary quadratic programs
- A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints
- Graph isomorphism: physical resources, optimization models, and algebraic characterizations
- On Integrality in Semidefinite Programming for Discrete Optimization
- Two-stage stochastic standard quadratic optimization
- Correlation matrices, Clifford algebras, and completely positive semidefinite rank
- On the accuracy of uniform polyhedral approximations of the copositive cone
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
- Optimality conditions for linear copositive programming problems with isolated immobile indices
- 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
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
- The Maximum k-Colorable Subgraph Problem and Related Problems
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Testing copositivity via mixed-integer linear programming
- Foundations of set-semidefinite optimization
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- Lifting for simplicity: concise descriptions of convex sets
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- A note on Burer's copositive representation of mixed-binary QPs
- Distributionally Robust Chance Constrained Geometric Optimization
- SPN completable graphs
- Can you cover your shadows?
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- A notion of total dual integrality for convex, semidefinite, and extended formulations
- Conic approximation to quadratic optimization with linear complementarity constraints
- A note on completely positive relaxations of quadratic problems in a multiobjective framework
- Exploiting partial correlations in distributionally robust optimization
- Quadratic optimization over one first-order cone
- Quadratic optimization with switching variables: the convex hull for \(n=2\)
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- Polyhedral approximations of the semidefinite cone and their application
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- On conic QPCCs, conic QCQPs and completely positive programs
- Quadratic optimization over a polyhedral cone
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- Approximation hierarchies for the cone of flow matrices
- New bounds for nonconvex quadratically constrained quadratic programming
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- An improved algorithm to test copositivity
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
- On the computational complexity of membership problems for the completely positive cone and its dual
- Least squares approximation to the distribution of project completion times with Gaussian uncertainty
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
- A guide to conic optimisation and its applications
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
- Quadratic factorization heuristics for copositive programming
- Conic relaxations for semi-supervised support vector machines
- Geometry of the copositive and completely positive cones
- Exceptional family and solvability of copositive complementarity problems
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- Binary quadratic optimization problems that are difficult to solve by conic relaxations
- Completely positive factorization by a Riemannian smoothing method
- 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
- Stochastic nonlinear resource allocation problem
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Distributionally robust mixed integer linear programs: persistency models with applications
- Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Completely positive and copositive program modelling for quadratic optimization problems
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- On the set-semidefinite representation of nonconvex quadratic programs with cone constraints
- Gaddum's test for symmetric cones
- A random copositive matrix is completely positive with positive probability
- Copositive optimization -- recent developments and applications
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- Analytical expressions of copositivity for fourth-order symmetric tensors
- Burer's key assumption for semidefinite and doubly nonnegative relaxations
- Matrix relaxations in combinatorial optimization
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- 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
- A survey of hidden convex optimization
- Completely positive tensor recovery with minimal nuclear value
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- An efficient inexact ABCD method for least squares semidefinite programming
- Bounding the separable rank via polynomial optimization
- A proximal DC approach for quadratic assignment problem
- Binary positive semidefinite matrices and associated integer polytopes
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Chance constrained \(0-1\) quadratic programs using copulas
- Strong duality for general quadratic programs with quadratic equality constraints
- Semidefinite approximations for quadratic programs over orthogonal matrices
- An exact quadratic programming approach based on convex reformulation for seru scheduling problems
- Robust quadratic programming with mixed-integer uncertainty
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- On the stable solution of large scale problems over the doubly nonnegative cone
- Generalizations of doubly nonnegative cones and their comparison
- Representing quadratically constrained quadratic programs as generalized copositive programs
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)
