On the proximal Landweber Newton method for a class of nonsmooth convex problems (2014)
Attributed to:
Foundation and Reweighted Algorithms for Sparsest Points of Convex Sets with Application to Data Processing
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/s10589-014-9703-7
Publication URI: http://dx.doi.org/10.1007/s10589-014-9703-7
Type: Journal Article/Review
Parent Publication: Computational Optimization and Applications
Issue: 1