Better approximation and faster algorithm using the proximal average

Advances in Neural Information Processing Systems

Volumn , Issue , 2013, Pages

  Yu, Yaoliang ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL CHALLENGES; CONVEX ANALYSIS; FUSED LASSOS; GRADIENT ALGORITHM; LARGE-SCALE MACHINE LEARNING; NUMERICAL EXPERIMENTS; OVERLAPPING GROUPS; SMOOTH FUNCTIONS;

APPROXIMATION ALGORITHMS;

EID: 84898962182     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Walter Rudin. Principles of mathematical analysis. McGraw-Hill, 3rd edition, 1976.
2. Amir Beck and Marc Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences, 2(1):183-202, 2009.
3. Yurii Nesterov. Gradient methods for minimizing composite functions. Mathematical Programming, Series B, 140:125-161, 2013.
4. Francis Bach, Rodolphe Jenatton, Julien Mairal, and Guillaume Obozinski. Structured sparsity through convex optimization. Statistical Science, 27(4):450-468, 2012.
5. Peng Zhao, Guilherme Rocha, and Bin Yu. The composite absolute penalties family for grouped and hierarchical variable selection. Annals of Statistics, 37(6A):3468-3497, 2009.
6. Seyoung Kim and Eric P. Xing. Statistical estimation of correlated genome associations to a quantitative trait network. PLoS Genetics, 5(8):1-18, 2009.
7. Naum Z. Shor. Minimization Methods for Non-Differentiable Functions. Springer, 1985.
8. Yurii Nesterov. Smooth minimization of non-smooth functions. Mathematical Programming, 103(1):127-152, 2005.
9. Patrick L. Combettes and Jean-Christophe Pesquet. Proximal splitting methods in signal processing. In Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pages 185-212. Springer, 2011.
10. Silvia Villa, Saverio Salzo, Luca Baldassarre, and Alessandro Verri. Accelerated and inexact forward-backward algorithms. SIAM Journal on Optimization, 23(3):1607-1633, 2013.
11. Heinz H. Bauschke, Rafal Goebel, Yves Lucet, and Xianfu Wang. The proximal average: Basic theory. SIAM Journal on Optimization, 19(2):766-785, 2008.
12. Robert Tibshirani, Michael Saunders, Saharon Rosset, Ji Zhu, and Keith Knight. Sparsity and smoothness via the fused lasso. Journal of the Royal Statistical Society: Series B, 67:91-108, 2005.
13. Xi Chen, Qihan Lin, Seyoung Kim, Jaime G. Carbonell, and Eric P. Xing. Smoothing proximal gradient method for general structured sparse regression. The Annals of Applied Statistics, 6 (2):719-752, 2012.
14. Ralph Tyrell Rockafellar and Roger J-B Wets. Variational Analysis. Springer, 1998.
15. Jean J. Moreau. Proximité et dualtité dans un espace Hilbertien. Bulletin de la Société Mathématique de France, 93:273-299, 1965.
16. Ralph Tyrrell Rockafellar. Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization, 14(5):877-898, 1976.
17. Heinz H. Bauschke and Patrick L. Combettes. Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, 1st edition, 2011.
18. Hua Ouyang, Niao He, Long Q. Tran, and Alexander Gray. Stochastic alternating direction method of multipliers. In International Conference on Machine Learning, 2013.
19. Taiji Suzuki. Dual averaging and proximal gradient descent for online alternating direction multiplier method. In International Conference on Machine Learning, 2013.
20. Yaoliang Yu. Fast Gradient Algorithms for Stuctured Sparsity. PhD thesis, University of Alberta, 2013.