Pages that link to "Item:Q1949258"

The following pages link to Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258):

Displaying 19 items.

• Testing copositivity with the help of difference-of-convex optimization (Q359631) (← links)
• On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets (Q360522) (← links)
• Copositivity and constrained fractional quadratic problems (Q403649) (← links)
• Copositive optimization -- recent developments and applications (Q421783) (← links)
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
• An improved algorithm to test copositivity (Q427387) (← links)
• Copositivity and sparsity relations using spectral properties (Q504815) (← links)
• Quadratic factorization heuristics for copositive programming (Q542052) (← links)
• LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← links)
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
• A modified simplex partition algorithm to test copositivity (Q2052385) (← links)
• Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme (Q2355798) (← links)
• A new certificate for copositivity (Q2418975) (← links)
• On the exhaustivity of simplicial partitioning (Q2442641) (← links)
• Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)
• A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors (Q4687245) (← links)
• Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA (Q5095184) (← links)
• Copositivity tests based on the linear complementarity problem (Q5963680) (← links)
• Hybrid simplicial-randomized approximate stochastic dynamic programming for multireservoir optimization (Q6538816) (← links)