Adaptive smoothing algorithms for nonsmooth composite convex minimization
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Quoc Tran Dinh & Carlo Savorgnan & Moritz Diehl, 2013. "Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems," Computational Optimization and Applications, Springer, vol. 55(1), pages 75-111, May.
- A. Belloni & V. Chernozhukov & L. Wang, 2011. "Square-root lasso: pivotal recovery of sparse signals via conic programming," Biometrika, Biometrika Trust, vol. 98(4), pages 791-806.
- Radu Boţ & Christopher Hendrich, 2013. "A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems," Computational Optimization and Applications, Springer, vol. 54(2), pages 239-262, March.
- DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2012. "Double smoothing technique for large-scale linearly constrained convex optimization," CORE Discussion Papers RP 2423, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
More about this item
KeywordsNesterov’s smoothing technique; Accelerated proximal-gradient method; Adaptive algorithm; Composite convex minimization; Nonsmooth convex optimization;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:66:y:2017:i:3:d:10.1007_s10589-016-9873-6. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .