On the copositive representation of binary and continuous nonconvex quadratic programs
From MaRDI portal
(Redirected from 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
- A Copositive Programming Approach to Graph Partitioning
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- 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
- scientific article; zbMATH DE number 3431982 (Why is no real title available?)
- 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)- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Can you cover your shadows?
- Completely positive tensor recovery with minimal nuclear value
- LP-based tractable subcones of the semidefinite plus nonnegative cone
- Completely positive reformulations of polynomial optimization problems with linear constraints
- A fresh CP look at mixed-binary QPs: new formulations and relaxations
- 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 note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Approximation hierarchies for the cone of flow matrices
- 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
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Completely positive semidefinite rank
- Simplified semidefinite and completely positive relaxations
- Building a completely positive factorization
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming
- A new conic approach to semisupervised support vector machines
- On convex relaxations for quadratically constrained quadratic programming
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- Separating doubly nonnegative and completely positive matrices
- Separation and relaxation for cones of quadratic forms
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- A note on Burer's copositive representation of mixed-binary QPs
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- Gaddum's test for symmetric cones
- A proximal DC approach for quadratic assignment problem
- Polyhedral approximations of the semidefinite cone and their application
- Quadratic optimization with switching variables: the convex hull for \(n=2\)
- A modified simplex partition algorithm to test copositivity
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- Two-stage stochastic standard quadratic optimization
- Strong duality for general quadratic programs with quadratic equality constraints
- Optimization hierarchy for fair statistical decision problems
- A note on completely positive relaxations of quadratic problems in a multiobjective framework
- Ideal formulations for constrained convex optimization problems with indicator variables
- Bounding the separable rank via polynomial optimization
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- On monotonicity and search strategies in face-based copositivity detection algorithms
- Triangle-free graphs and completely positive matrices
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices
- A factorization method for completely positive matrices
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- An exact completely positive programming formulation for the discrete ordered median problem: an extended version
- A survey of hidden convex optimization
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
- Hermitian completely positive matrices
- Completely positive tensors in the complex field
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
- Testing copositivity via mixed-integer linear programming
- Exploiting partial correlations in distributionally robust optimization
- A note on convex reformulation schemes for mixed integer quadratic programs
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
- A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
- A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- A gentle, geometric introduction to copositive optimization
- Completely positive reformulations for polynomial optimization
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- Mathematical optimization ideas for biodiversity conservation
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
- Conic approximation to quadratic optimization with linear complementarity constraints
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
- Copositive programming via semi-infinite optimization
- Factorization and cutting planes for completely positive matrices by copositive projection
- Quadratic optimization over one first-order cone
- A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints
- Quadratic optimization over a polyhedral cone
- Continuous quadratic programming formulations of optimization problems on graphs
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Computable representations for convex hulls of low-dimensional quadratic forms
- Copositivity cuts for improving SDP bounds on the clique number
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- The boosted DC algorithm for linearly constrained DC programming
- Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow
- New bounds for nonconvex quadratically constrained quadratic programming
- SPN completable graphs
- Conic formulation of QPCCs applied to truly sparse QPs
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- Copositive programming
- An efficient inexact ABCD method for least squares semidefinite programming
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Conic relaxations for semi-supervised support vector machines
- Matrix relaxations in combinatorial optimization
- On the set-semidefinite representation of nonconvex quadratic programs with cone constraints
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- Necessary and sufficient conditions for copositive tensors
- Least squares approximation to the distribution of project completion times with Gaussian 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)
