Block splitting for distributed optimization

Mathematical Programming Computation

Volumn 6, Issue 1, 2014, Pages 77-102

  Parikh, Neal ^a   Boyd, Stephen ^a  

^a Stanford University   (United States)

Author keywords

Alternating direction method of multipliers; Cone programming; Distributed optimization; Machine learning; Operator splitting; Proximal operators

Indexed keywords

ALTERNATING DIRECTION METHOD OF MULTIPLIERS; CONVEX OPTIMIZATION PROBLEMS; DISTRIBUTED COMPUTING ENVIRONMENT; DISTRIBUTED OPTIMIZATION; DOUGLAS-RACHFORD SPLITTING; NUMERICAL EXPERIMENTS; OPERATOR-SPLITTING; SPLITTING ALGORITHMS;

CONVEX OPTIMIZATION; LEARNING SYSTEMS; MATHEMATICAL OPERATORS; OPTIMIZATION;

PROBLEM SOLVING;

EID: 84898065835     PISSN: 18672949     EISSN: 18672957     Source Type: Journal    
DOI: 10.1007/s12532-013-0061-8     Document Type: Article

References (32)

1. Boyd, S.; Parikh, N.; Chu, E.; Peleato, B.; Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1-122 (2011)
2. Luenberger, D.G.: Optimization by Vector Space Methods. Wiley, New York (1969)
3. Nesterov, Y.; Nemirovskii, A.: Interior-Point Polynomial Methods in Convex Programming. Society for Industrial and Applied Mathematics (1994)
4. Ben-Tal, A.; Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. Society for Industrial and Applied Mathematics (2001)
5. Boyd, S.; Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
6. Wen, Z.; Goldfarb, D.; Yin, W.: Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Program. Comput. 2(3), 203-230 (2010)
7. Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B 58(1), 267-288 (1996)
8. Group, I.M.R.T.C.W.: Intensity-modulated radiotherapy: Current status and issues of interest. Int. J. Radiat. Oncol. Biol. Phys. 51(4), 880-914 (2001)
9. Webb, S.: Intensity-Modulated Radiation Therapy. Taylor & Francis (2001)
10. Moreau, J.J.: Fonctions convexes duales et points proximaux dans un espace Hilbertien. Rep. Paris Acad. Sci. Ser. A 255, 2897-2899 (1962)
11. Parikh, N.; Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 1-108 (2013). To appear
12. Eckstein, J.; Ferris, M.C.: Operator-splitting methods for monotone affine variational inequalities, with a parallel application to optimal control. INFORMS J. Comput. 10(2), 218-235 (1998) (Pubitemid 128669129)
13. Yang, J.; Zhang, Y.: Alternating direction algorithms for ℓ -1 ℓ -1 -problems in compressive sensing. SIAM J. Sci. Comput. 33(1), 250-278 (2011)
14. Yuan, M.; Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. Ser. B (Statistical Methodology) 68(1), 49-67 (2006) (Pubitemid 43415335)
15. Ohlsson, H.; Ljung, L.; Boyd, S.: Segmentation of ARX-models using sum-of-norms regularization. Automatica 46(6), 1107-1111 (2010)
16. Agarwal, A.; Chapelle, O.; Dudik, M.; Langford, J.: A reliable effective terascale linear learning, system. arXiv:1110.4198 (2011)
17. Grant, M.; Boyd, S.: CVX: Matlab software for disciplined convex programming (2008). http://cvxr.com/cvx
18. Sturm, J.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(1-4), 625-653 (1999)
19. Toh, K.C.; Todd, M.J.; Tütüncü, R.H.: SDPT3: a MATLAB software package for semidefinite programming, version 1.3. Optim. Methods Softw. 11(1-4), 545-581 (1999)
20. CVX Research, I.: CVX: Matlab software for disciplined convex programming, version 2.0 beta. http://cvxr.com/cvx/examples (2012). Example library
21. Whaley, R.C.; Dongarra, J.J.: Automatically tuned linear algebra software. In: Proceedings of the 1998 ACM/IEEE Conference on Supercomputing (CDROM), pp. 1-27 (1998)
22. Vanderbei, R.J.: Symmetric quasi-definite matrices. SIAM J. Optim. 5(1), 100-113 (1995)
23. Saunders, M.A.: Cholesky-based methods for sparse least squares: the benefits of regularization. In: Adams, L.; Nazareth, J.L. (eds.) Linear and Nonlinear Conjugate Gradient-Related Methods, pp. 92-100. SIAM, Philadelphia (1996)
24. Davis, T.A.: Algorithm 8xx: a concise sparse Cholesky factorization package. ACM Trans. Math. Softw. 31(4), 587-591 (2005)
25. Amestoy, P.; Davis, T.A.; Duff, I.S.: An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17(4), 886-905 (1996)
26. Amestoy, P.; Davis, T.A.; Duff, I.S.: Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30(3), 381-388 (2004)
27. Davis, T.A.: Direct Methods for Sparse Linear Systems. SIAM, Philadelphia (2006)
28. Benzi, M.; Meyer, C.D.; Tuma, M.: A sparse approximate inverse preconditioner for the conjugate gradient method. SIAM J. Sci. Comput. 17(5), 1135-1149 (1996) (Pubitemid 126598127)
29. Benzi, M.: Preconditioning techniques for large linear systems: a survey. J. Comput. Phys. 182(2), 418-477 (2002) (Pubitemid 36010064)
30. Golub, G.H.; Van Loan, C.: Matrix Computations, vol. 3. Johns Hopkins University Press, Baltimore (1996)
31. Wilkinson, J.H.: Rounding Errors in Algebraic Processes. Dover (1963)
32. Moler, C.B.: Iterative refinement in floating point. J. ACM 14(2), 316-321 (1967)