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)- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- On copositive programming and standard quadratic optimization problems
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
- Exceptional family and solvability of copositive complementarity problems
- Burer's key assumption for semidefinite and doubly nonnegative relaxations
- Mathematical optimization ideas for biodiversity conservation
- SPN completable graphs
- Computable representations for convex hulls of low-dimensional quadratic forms
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- A note on Burer's copositive representation of mixed-binary QPs
- Chance constrained \(0-1\) quadratic programs using copulas
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- A polynomial-time algorithm for computing low CP-rank decompositions
- Quadratic factorization heuristics for copositive programming
- Globally solving nonconvex quadratic programming problems via completely positive programming
- On the set-semidefinite representation of nonconvex quadratic programs with cone constraints
- Geometry of the copositive and completely positive cones
- Building a completely positive factorization
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- Testing copositivity via mixed-integer linear programming
- Conic relaxations for semi-supervised support vector machines
- An improved algorithm to test copositivity
- A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
- Separating doubly nonnegative and completely positive matrices
- Separation and relaxation for cones of quadratic forms
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Computing symmetric nonnegative rank factorizations
- On the stable solution of large scale problems over the doubly nonnegative cone
- Copositivity and constrained fractional quadratic problems
- On convex relaxations for quadratically constrained quadratic programming
- The Maximum k-Colorable Subgraph Problem and Related Problems
- Copositive matrices with circulant zero support set
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Stochastic nonlinear resource allocation problem
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
- Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems
- Moment approximations for set-semidefinite polynomials
- Contribution of copositive formulations to the graph partitioning problem
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- On conic QPCCs, conic QCQPs and completely positive programs
- Factorization and cutting planes for completely positive matrices by copositive projection
- Exact computable representation of some second-order cone constrained quadratic programming problems
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Computing the distance between the linear matrix pencil and the completely positive cone
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- On the computational complexity of membership problems for the completely positive cone and its dual
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes
- On the accuracy of uniform polyhedral approximations of the copositive cone
- A note on set-semidefinite relaxations of nonconvex quadratic programs
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- Necessary and sufficient conditions for copositive tensors
- Foundations of set-semidefinite optimization
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Completely positive reformulations for polynomial optimization
- Can you cover your shadows?
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Interiors of completely positive cones
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Copositive optimization -- recent developments and applications
- Copositive programming
- Copositivity cuts for improving SDP bounds on the clique number
- A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints
- Distributionally robust mixed integer linear programs: persistency models with applications
- A note on convex reformulation schemes for mixed integer quadratic programs
- The \(\mathcal A\)-truncated \(K\)-moment problem
- A gentle, geometric introduction to copositive optimization
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Conic approximation to quadratic optimization with linear complementarity constraints
- Optimization under uncertainty and risk: quadratic and copositive approaches
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
- Strong duality for general quadratic programs with quadratic equality constraints
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- LP-based tractable subcones of the semidefinite plus nonnegative cone
- Quadratic optimization over a polyhedral cone
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- Continuous quadratic programming formulations of optimization problems on graphs
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- Correlation matrices, Clifford algebras, and completely positive semidefinite rank
- Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls
- Copositive programming via semi-infinite optimization
- 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 and copositive program modelling for quadratic optimization problems
- A new conic approach to semisupervised support vector machines
- Completely positive semidefinite rank
- A survey of hidden convex optimization
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- Robust quadratic programming with mixed-integer uncertainty
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)
