Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers

被引:357
作者
Lin, Fu [1 ]
Fardad, Makan [2 ]
Jovanovic, Mihailo R. [1 ]
机构
[1] Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN 55455 USA
[2] Syracuse Univ, Dept Elect Engn & Comp Sci, Syracuse, NY 13244 USA
基金
美国国家科学基金会;
关键词
Alternating direction method of multipliers (ADMM); communication architectures; continuation methods; l(1) minimization; optimization; separable penalty functions; sparsity-promoting optimal control; structured distributed design;
D O I
10.1109/TAC.2013.2257618
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We design sparse and block sparse feedback gains that minimize the variance amplification (i.e., the H-2 norm) of distributed systems. Our approach consists of two steps. First, we identify sparsity patterns of feedback gains by incorporating sparsity-promoting penalty functions into the optimal control problem, where the added terms penalize the number of communication links in the distributed controller. Second, we optimize feedback gains subject to structural constraints determined by the identified sparsity patterns. In the first step, the sparsity structure of feedback gains is identified using the alternating direction method of multipliers, which is a powerful algorithm well-suited to large optimization problems. This method alternates between promoting the sparsity of the controller and optimizing the closed-loop performance, which allows us to exploit the structure of the corresponding objective functions. In particular, we take advantage of the separability of the sparsity-promoting penalty functions to decompose the minimization problem into sub-problems that can be solved analytically. Several examples are provided to illustrate the effectiveness of the developed approach.
引用
收藏
页码:2426 / 2431
页数:6
相关论文
共 26 条
[1]  
[Anonymous], 1983, AUGMENTED LAGRANGIAN, DOI DOI 10.1016/S0168-2024(08)70028-6
[2]  
[Anonymous], 1989, SIAM STUDIES APPL MA
[3]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[4]  
Boyd S., 2004, CONVEX OPTIMIZATION
[5]   Near-optimal signal recovery from random projections: Universal encoding strategies? [J].
Candes, Emmanuel J. ;
Tao, Terence .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (12) :5406-5425
[6]   Enhancing Sparsity by Reweighted l1 Minimization [J].
Candes, Emmanuel J. ;
Wakin, Michael B. ;
Boyd, Stephen P. .
JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS, 2008, 14 (5-6) :877-905
[7]  
Dhingra N., 2012, 3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems, Santa Barbara, CA, P305
[8]  
Fardad Makan, 2011, 2011 American Control Conference - ACC 2011, P2050
[9]  
Fardad M, 2012, IEEE DECIS CONTR P, P2539, DOI 10.1109/CDC.2012.6426070
[10]  
Fardad M, 2012, P AMER CONTR CONF, P4777