Pages that link to "Item:Q2294228"
From MaRDI portal
The following pages link to Using a factored dual in augmented Lagrangian methods for semidefinite programming (Q2294228):
Displaying 6 items.
- A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation (Q2023115) (← links)
- An SDP-based approach for computing the stability number of a graph (Q2123126) (← links)
- SDP-based bounds for graph partition via extended ADMM (Q2125076) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- Improving ADMMs for solving doubly nonnegative programs through dual factorization (Q2240675) (← links)
- Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA (Q5095184) (← links)
