Pages that link to "Item:Q1942269"
From MaRDI portal
The following pages link to Separating doubly nonnegative and completely positive matrices (Q1942269):
Displaying 15 items.
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← links)
- \(\{0,1\}\) completely positive tensors and multi-hypergraphs (Q501224) (← links)
- Geometry of the copositive and completely positive cones (Q534759) (← links)
- On \(\{0,1\}\) CP tensors and CP pseudographs (Q1790471) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
- Generating irreducible copositive matrices using the stable set problem (Q2664002) (← links)
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes (Q2696926) (← links)
- Copositive Programming (Q2802526) (← links)
- Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations (Q2834695) (← links)
- (Q5054600) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
