Pages that link to "Item:Q2349130"

The following pages link to Completely positive reformulations for polynomial optimization (Q2349130):

Displaying 33 items.

• Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization (Q283932) (← links)
• \(\{0,1\}\) completely positive tensors and multi-hypergraphs (Q501224) (← links)
• A semidefinite algorithm for completely positive tensor decomposition (Q513715) (← links)
• Copositive tensor detection and its applications in physics and hypergraphs (Q683337) (← links)
• Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
• Copositivity detection of tensors: theory and algorithm (Q1673917) (← links)
• Completely positive reformulations of polynomial optimization problems with linear constraints (Q1679621) (← links)
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
• On \(\{0,1\}\) CP tensors and CP pseudographs (Q1790471) (← links)
• Structured rectangular tensors and rectangular tensor complementarity problems (Q2007086) (← links)
• An SDP method for copositivity of partially symmetric tensors (Q2007119) (← links)
• An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
• An exact completely positive programming formulation for the discrete ordered median problem: an extended version (Q2176282) (← links)
• Hermitian completely positive matrices (Q2197205) (← links)
• Completely positive tensors in the complex field (Q2197844) (← links)
• Hypergraph characterizations of copositive tensors (Q2238061) (← links)
• A hierarchy of semidefinite relaxations for completely positive tensor optimization problems (Q2274887) (← links)
• On copositiveness identification of partially symmetric rectangular tensors (Q2297174) (← links)
• Test of copositive tensors (Q2313772) (← links)
• Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
• Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations (Q2834695) (← links)
• A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors (Q4687245) (← links)
• The Discrete Moment Problem with Nonconvex Shape Constraints (Q4994156) (← links)
• Completely Positive Binary Tensors (Q5108231) (← links)
• A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems (Q5110556) (← links)
• (Q5124683) (← links)
• HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS (Q5148052) (← links)
• Geometry of the Copositive Tensor Cone and its Dual (Q5149522) (← links)
• Best Nonnegative Rank-One Approximations of Tensors (Q5203971) (← links)
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
• Approximation hierarchies for copositive cone over symmetric cone and their comparison (Q6122328) (← links)
• Copositive tensor optimization problem and its applications to hypergraphs (Q6189813) (← links)