Pages that link to "Item:Q3169093"
From MaRDI portal
The following pages link to The UGC Hardness Threshold of the <i>L<sub>p</sub></i> Grothendieck Problem (Q3169093):
Displaying 11 items.
- The \(\ell^p\)-Gaussian-Grothendieck problem with vector spins (Q2149938) (← links)
- Grothendieck constant is norm of Strassen matrix multiplication tensor (Q2334621) (← links)
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic (Q2353474) (← links)
- Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization (Q2448210) (← links)
- Grothendieck-Type Inequalities in Combinatorial Optimization (Q2892967) (← links)
- A Greedy Algorithm for Subspace Approximation Problem (Q5116494) (← links)
- Hardness and Approximation Results for <i>L<sub>p</sub></i>-Ball Constrained Homogeneous Polynomial Optimization Problems (Q5247613) (← links)
- Grothendieck’s Theorem, past and present (Q5389600) (← links)
- (Q5743431) (← links)
- Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms (Q5885598) (← links)
- A note on the Hausdorff distance between norm balls and their linear maps (Q6052489) (← links)
