On the complexity of L-p norm minimization for p less than 1
Yinyu Ye Stanford University
This web presentation contains the
audio and slides
of a lecture given at the Fields Institute on October 23, 2009
as part of the Workshop on Complexity of Numerical Computation.
RealPlayer 7 or later, or other software capable of
You may browse the slides
in the presentation (a browser capable of displaying PNG graphics
Or, you may download a higher-resolution printer-ready
in PDF format
(requires Acrobat Reader).