Pages that link to "Item:Q5444289"
From MaRDI portal
The following pages link to A Copositive Programming Approach to Graph Partitioning (Q5444289):
Displaying 42 items.
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets (Q360522) (← links)
- Moment approximations for set-semidefinite polynomials (Q382904) (← links)
- A note on set-semidefinite relaxations of nonconvex quadratic programs (Q386483) (← 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)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Exceptional family and solvability of copositive complementarity problems (Q662097) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
- LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← 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)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- Partitioning graphs on message-passing machines by pairwise mincut (Q1818794) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- On monotonicity and search strategies in face-based copositivity detection algorithms (Q2155140) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
- On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Algorithmic copositivity detection by simplicial partition (Q2477530) (← links)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- An exact penalty approach for optimization with nonnegative orthogonality constraints (Q2687065) (← links)
- The CP-matrix approximation problem (Q2790067) (← links)
- Copositive Programming (Q2802526) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique (Q3093056) (← links)
- Assignment Flows (Q3300540) (← links)
- Graph Partitioning and Continuous Quadratic Programming (Q4699174) (← links)
- Contribution of copositive formulations to the graph partitioning problem (Q4916308) (← links)
- Algorithm 996 (Q4960955) (← links)
- A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems (Q5110556) (← links)
- (Q5140710) (← links)
- Foundations of Set-Semidefinite Optimization (Q5188753) (← links)
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)
- On Degenerate Doubly Nonnegative Projection Problems (Q5868954) (← links)
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
- A note on the SDP relaxation of the minimum cut problem (Q6064052) (← links)
- Further development in convex conic reformulation of geometric nonconvex conic optimization problems (Q6622748) (← links)