The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers
Open accessAbstract
We design sparse and block sparse feedback gains that minimize the variance amplification (i.e., the H2norm) 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
Linear and Nonlinear Programming
Luenberger, D. G., & Ye, Y. (2008) · International Series in Operations Research & Management Science · doi:10.1007/978-0-387-74503-9 · Cited by 2,804
Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics
Glowinski, R., & Tallec, P. L. (1989) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970838 · Cited by 1,015
Portfolio optimization with linear and fixed transaction costs
Lobo, M. S., Fazel, M., & Boyd, S. (2007) · Annals of Operations Research · doi:10.1007/s10479-006-0145-1 · Cited by 350
Computational methods for parametric LQ problems--A survey
Makila, P., & Toivonen, H. (1987) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1987.1104686 · Cited by 232
Sparsity-promoting optimal control for a class of distributed systems
Fardad, M., Lin, F., & Jovanović, M. R. (2011) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2011.5991020 · Cited by 145
Self-citationPerformance and design of cycles in consensus networks
Zelazo, D., Schuler, S., & Allgöwer, F. (2012) · Systems & Control Letters · doi:10.1016/j.sysconle.2012.10.014 · Cited by 90
Jovanović, M. R., Arcak, M., & Sontag, E. D. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.911318 · Cited by 60
Algorithms for leader selection in large dynamical networks: Noise-corrupted leaders
Fu, L., Fardad, M., & Jovanović, M. R. (2011) · doi:10.1109/cdc.2011.6161507 · Cited by 49
Self-citationOn the optimal dissemination of information in social networks
Fardad, M., Zhang, X., Lin, F., & Jovanović, M. R. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426070 · Cited by 20
Self-citation
Cited by
A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems
Molzahn, D. K., Dorfler, F., Sandberg, H., Low, S. H., Chakrabarti, S., Baldick, R., & Lavaei, J. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2720471 · Cited by 1,273
Sparsity-promoting dynamic mode decomposition
Jovanović, M. R., Schmid, P. J., & Nichols, J. W. (2014) · Physics of Fluids · doi:10.1063/1.4863670 · Cited by 898
A survey of machine learning for big data processing
Qiu, J., Wu, Q., Ding, G., Xu, Y., & Feng, S. (2016) · EURASIP Journal on Advances in Signal Processing · doi:10.1186/s13634-016-0355-x · Cited by 894
Hong, M., Luo, Z.-Q., & Razaviyayn, M. (2016) · SIAM Journal on Optimization · doi:10.1137/140990309 · Cited by 841
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
O’Donoghue, B., Chu, E., Parikh, N., & Boyd, S. (2016) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-016-0892-3 · Cited by 664
“These techniques have been used in a broad range of applications including imaging [20, 41, 61], control [3, 49, 57, 62], estimation [82], signal processing [22, 23, 25, 86], finance [9], distributed optimization [47, 65], and many others.”
Method
Metadata
- Authors
- Lin, F., Fardad, M., & Jovanovic, M. R.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2013-09
- Volume
- 58
- Issue
- 9
- Pages
- 2426-2431
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W1980183459
- Cited by
- 385
- References
- 15
- FWCI
- 39.90
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.