Pages that link to "Item:Q2391001"
From MaRDI portal
The following pages link to On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001):
Displaying 50 items.
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices (Q840651) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- Cardinality constrained portfolio selection problem: a completely positive programming approach (Q898723) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← links)
- Can you cover your shadows? (Q1076344) (← links)
- Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
- LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← links)
- Completely positive reformulations of polynomial optimization problems with linear constraints (Q1679621) (← links)
- A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Approximation hierarchies for the cone of flow matrices (Q1742241) (← links)
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← links)
- Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides (Q1753067) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
- Completely positive semidefinite rank (Q1785204) (← links)
- Simplified semidefinite and completely positive relaxations (Q1785437) (← links)
- Building a completely positive factorization (Q1787912) (← links)
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming (Q1789641) (← links)
- A new conic approach to semisupervised support vector machines (Q1793456) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems (Q1926650) (← links)
- Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) (← links)
- A note on Burer's copositive representation of mixed-binary QPs (Q1958650) (← links)
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
- Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868) (← links)
- Gaddum's test for symmetric cones (Q2022297) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Quadratic optimization with switching variables: the convex hull for \(n=2\) (Q2044962) (← links)
- A modified simplex partition algorithm to test copositivity (Q2052385) (← links)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- Two-stage stochastic standard quadratic optimization (Q2077956) (← links)
- Strong duality for general quadratic programs with quadratic equality constraints (Q2082247) (← links)
- Optimization hierarchy for fair statistical decision problems (Q2112802) (← links)
- A note on completely positive relaxations of quadratic problems in a multiobjective framework (Q2114601) (← links)
- Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
- Bounding the separable rank via polynomial optimization (Q2144234) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- On monotonicity and search strategies in face-based copositivity detection algorithms (Q2155140) (← links)
- Triangle-free graphs and completely positive matrices (Q2155141) (← links)
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices (Q2158273) (← links)
