A dual method for minimizing a nonsmooth objective over one smooth inequality constraint

Title
A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
Authors
Keywords
Nonsmooth convex minimization, First order methods , Duality, Complexity/rate of convergence analysis, <em class=EmphasisTypeItalic >l</em><sub>1</sub>-norm minimization, Sparse recovery
Journal
MATHEMATICAL PROGRAMMING
Volume 159, Issue 1-2, Pages 137-164
Publisher
Springer Nature
Online
2015-10-05
DOI
10.1007/s10107-015-0952-8

Ask authors/readers for more resources

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search