# Approximating Matrix p-norms

@inproceedings{Bhaskara2011ApproximatingMP,
title={Approximating Matrix p-norms},
booktitle={SODA},
year={2011}
}
• Published 2011 in SODA
We consider the problem of computing the <i>q</i> ↦ <i>p</i> norm of a matrix <i>A</i>, which is defined for <i>p, q</i> ≥ 1, as [EQUATION] This is in general a non-convex optimization problem, and is a natural generalization of the well-studied question of computing singular values (this corresponds to <i>p</i> = <i>q</i> = 2). Different settings of parameters give rise to a variety of known interesting problems (such as the Grothendieck problem when <i>p</i> = 1 and <i>q</i> = ∞). However… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

#### Citations

##### Publications citing this paper.
Showing 1-10 of 19 extracted citations

## Randomized oblivious integral routing for minimizing power cost

Theor. Comput. Sci. • 2015
View 11 Excerpts
Highly Influenced

CVPR • 2018
View 1 Excerpt

## Inapproximability of Matrix p→q Norms

Electronic Colloquium on Computational Complexity • 2018

## On Sketching the q to p Norms

APPROX-RANDOM • 2018

View 2 Excerpts

## Online Learning to Rank with Top-k Feedback

Journal of Machine Learning Research • 2017
View 2 Excerpts

View 2 Excerpts

APJOR • 2016
View 2 Excerpts