Online alternating direction method

Proceedings of the 29th International Conference on Machine Learning, ICML 2012

Volumn 2, Issue , 2012, Pages 1119-1126

  Wang, Huahua ^a   Banerjee, Arindam ^a  

^a University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING DIRECTION METHODS; ALTERNATING DIRECTIONS; CONSTRAINT VIOLATION; CONVERGENCE RATES; CONVEX FUNCTIONS; FEASIBLE SET; LARGE-SCALE OPTIMIZATION; OBJECTIVE FUNCTIONS; ON-LINE ALGORITHMS; ON-LINE SETTING; ONLINE OPTIMIZATION;

LEARNING SYSTEMS;

ALGORITHMS;

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

References (24)

1. Barman, S., Liu, X., Draper, S., and Recht, B. Decomposition methods for large scale LP decoding. In Arxiv, . 2012.
2. Beck, A. and Teboulle, M. Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters, 31:167-175, 2003.
3. Bertsekas, D. P. and Tsitsiklis, J. N. Parallel and Distributed Computation: Numerical Methods. Prentice Hall, 1989.
4. Boyd, S., N. Parikh, E. Chu, Peleato, B., and Eckstein, J. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundation Trends Machine Learning, 3(1):1-122, 2010.
5. Censor, Y. and Zenios, S. Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, 1998.
6. Duchi, J. and Singer, Y. Efficient online and batch learning using forward backward splitting. JMLR, 10:2873-2898, 2009.
7. Duchi, J., Shalev-Shwartz, S., Singer, Y., and Tewari, A. Composite objective mirror descent. In COLT, 2010.
8. Duchi, J., Agarwal, A., and Wainwright, M. Dual averaging for distributed optimization: Convergence analysis and network scaling. arXiv, 2011.
9. Eckstein, J. and Bertsekas, D.P. On the douglas-rachford splitting method and the proximal point algorithm for maximal monotone operators. Mathematical Programming, 55:293-318, 1992.
10. Facchinei, F. and Pang, J.-S. Finite-Dimensional Variational Inequalities and Complementarity Problems, volume I. Springer, 2003.
11. Gabay, D. and Mercier, B. A dual algorithm for the solution of nonlinear variational problems via finite-element approximations. Computers and Mathematics with Applications, 2:17-40, 1976.
12. Golub, G. H. and Loan, C. V. Matrix Computations, 3rd ed. Johns Hopkins University Press, 1996.
13. Hazan, E., Agarwal, A., and Kale, S. Logarithmic regret algorithms for online convex optimization. Machine Learning, 69(2-3):169-192, 2007.
14. Juditsky, A., Lan, G., Nemirovski, A., and Shapiro, A. Stochastic approximation approach to stochastic programming. SIAM J. Optim., 19:1574-1609, 2009.
15. Lin, Z., Chen, M., Wu, L., and Ma, Y. The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. UIUC Technical Report UILU-ENG-09-2215, 2009.
16. Mahdavi, M., Jin, R., and Yang, T. Trading regret for efficiency: Online convex optimization with long term constraints. Arxiv, 2011.
17. Mannor, S. and Tsitsiklis, J. N. Online learning with constraints. In COLT, pp. 529-543, 2006.
18. Meshi, O. and Globerson, A. An alternating direction method for dual MAP LP relaxation. In ECML11, 2011.
19. Nemirovski, A. Prox-method with rate of convergence O(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim., 15:229-251, 2004.
20. Nesterov, Y. Primal-dual subgradient methods for convex problems. Mathematical Programming, 120:221-259, 2009.
21. Rudin, L., Osher, S. J., and Fatemi, E. Nonlinear total variation based noise removal algorithms. Physica D, 60: 259-268, 1992.
22. Tibshirani, R. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B, 58:267-288, 1996.
23. Xiao, L. Dual averaging methods for regularized stochastic learning and online optimization. JMLR, 11:2543-2596, 2010.
24. Zinkevich, M. Online convex programming and generalized infinitesimal gradient ascent. In ICML, pp. 928-936, 2003.