On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
From MaRDI portal
(Redirected from Publication:360522)
Recommendations
- On the set-semidefinite representation of nonconvex quadratic programs with cone constraints
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Representing quadratically constrained quadratic programs as generalized copositive programs
- A note on set-semidefinite relaxations of nonconvex quadratic programs
- Approximating non-convex quadratic programs by semidefinite and copositive programming
Cites work
- scientific article; zbMATH DE number 5493304 (Why is no real title available?)
- A Copositive Programming Approach to Graph Partitioning
- A Survey of the S-Lemma
- A note on Burer's copositive representation of mixed-binary QPs
- A semidefinite programming approach to the hypergraph minimum bisection problem
- Algorithmic copositivity detection by simplicial partition
- 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
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Foundations of set-semidefinite optimization
- On Cones of Nonnegative Quadratic Functions
- On copositive programming and standard quadratic optimization problems
- On the computation of \(C^*\) certificates
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the set-semidefinite representation of nonconvex quadratic programs with cone constraints
- Representing quadratically constrained quadratic programs as generalized copositive programs
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
Cited in
(23)- Convex hull results on quadratic programs with non-intersecting constraints
- Semidefinite representable reformulations for two variants of the trust-region subproblem
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- On equivalent representations and properties of faces of the cone of copositive matrices
- Finding quadratic underestimators for optimal value functions of nonconvex all-quadratic problems via copositive optimization
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- New bounds for nonconvex quadratically constrained quadratic programming
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization
- On the set-semidefinite representation of nonconvex quadratic programs with cone constraints
- Stability analysis of discrete-time linear complementarity systems
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier
- Quadratic optimization over a second-order cone with linear equality constraints
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- Conic optimization techniques yield sufficient conditions for set-completely positive matrix completion under arrowhead specification pattern
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
- The convex feasible set algorithm for real time optimization in motion planning
- Optimization under uncertainty and risk: quadratic and copositive approaches
- Moment approximations for set-semidefinite polynomials
- Exact computable representation of some second-order cone constrained quadratic programming problems
This page was built for publication: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360522)
