Distributed estimation via dual decomposition

2007 European Control Conference, ECC 2007

Volumn , Issue , 2007, Pages 1511-1516

  Samar, Sikandar ^a   Boyd, Stephen ^b   Gorinevsky, Dimitry ^b  

^a SIEMENS CORPORATE RESEARCH   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; DATA FUSION; SIGNAL PROCESSING;

COUPLING CONSTRAINTS; DISTRIBUTED ESTIMATION; DUAL DECOMPOSITION; GLOBALLY OPTIMAL ESTIMATES; LEAST MEAN SQUARE (LMS); LOG-LIKELIHOOD FUNCTIONS; MAXIMUM A POSTERIORI PROBABILITIES; SUB-GRADIENT METHODS;

MAXIMUM LIKELIHOOD ESTIMATION;

EID: 84927739695     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.23919/ecc.2007.7069016     Document Type: Conference Paper

References (21)

1. M. Akgül. Topics in Relaxation and Ellipsoidal Methods, volume 97 of Research Notes in Mathematics. Pitman, 1984.
2. J. F. Benders. Partioning procedures for solving mixedvariables programming problems. Numerische Mathematik, 4:238-252, 1962.
3. D. P. Bertsekas. Nonlinear Programming. Athena Scientific, second edition, 1999.
4. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Athena Scientific, 1997.
5. M. Chiang, S. H. Low, A. R. Calderbank, and J. C. Doyle. Layering as optimization decomposition: A mathematical theory of network architectures. Proceedings of the IEEE, January 2007. To appear.
6. Y. Censor and S. Zenios. Parallel Optimization. Oxford University Press, 1997.
7. G. B. Dantzig and P. Wolfe. Decomposition principle for linear programs. Operations Research, 8:101-111, 1960.
8. J. Gondzio, R. Sarkissian, and J.-Ph. Vial. Parallel implementation of a central decomposition method for solving large-scale planning problems. Comput. Optim. Appl., 19(1):5-29, 2001.
9. B. Hendrickson and T. G. Kolda. Graph partitioning models for parallel computing. Parallel Computing, 26(12):1519-1534, 2000.
10. F. Kelly, A. Maulloo, and D. Tan. Rate control for communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49:237-252, 1997.
11. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., San Francisco, CA, 1996.
12. A. Nedíc and D. P. Bertsekas. Incremental subgradient methods for nondifferentiable optimization. SIAM J. on Optimization, 12:109-138, 2001.
13. Y. Nesterov. Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, 2004.
14. Y. Nesterov. Primal-dual subgradient methods for convex problems. CORE Discussion Paper #2005/67. Available at www. core. ucl. Ac. be/services/psfiles/ dp05/dp2005-67. pdf, 2005.
15. A. Nemirovski and D. Yudin. Problem Complexity and Method Efficiency in Optimization. Wiley-Interscience, 1983.
16. B. T. Polyak. Introduction to Optimization. Optimization Software Inc., New York, 1987.
17. A. Ruszczýnski. Nonlinear Optimization. Princeton University Press, 2006.
18. N. Z. Shor. Minimization Methods for Non-differentiable Functions. Springer Series in Computational Mathematics. Springer, 1985.
19. N. Z. Shor. Nondifferentiable Optimization and Polynomial Problems. Nonconvex Optimization and its Applications. Kluwer Academics Publishers, 1998.
20. H. D. Simon. Partitioning of unstructured problems for parallel processing. Computing Systems in Engineering, 2:135-148, 1991.
21. G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, second edition, 1994.