Pages that link to "Item:Q623464"
From MaRDI portal
The following pages link to An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464):
Displaying 13 items.
- DSDP5 (Q16587) (← links)
- A feasible method for optimization with orthogonality constraints (Q101635) (← links)
- Computing the nearest low-rank correlation matrix by a simplified SQP algorithm (Q299647) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs (Q724411) (← links)
- Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (Q839323) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- (Q5425124) (← links)
- Computational enhancements in low-rank semidefinite programming (Q5475287) (← links)
- Near-term quantum algorithm for solving the MaxCut problem with fewer quantum resources (Q6593524) (← links)
- Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds (Q6593831) (← links)
