A note on the complexity of L p minimization

Title
A note on the complexity of L p minimization
Authors
Keywords
-
Journal
MATHEMATICAL PROGRAMMING
Volume 129, Issue 2, Pages 285-299
Publisher
Springer Nature
Online
2011-06-04
DOI
10.1007/s10107-011-0470-2

Ask authors/readers for more resources

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started