The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Penalty Dual Decomposition Method for Nonsmooth Nonconvex Optimization—Part I: Algorithms and Convergence Analysis
Abstract
Many contemporary signal processing, machine learning and wireless communication applications can be formulated as nonconvex nonsmooth optimization problems. Often there is a lack of efficient algorithms for these problems, especially when the optimization variables are nonlinearly coupled in some nonconvex constraints. In this work, we propose an algorithm named penalty dual decomposition (PDD) for these difficult problems and discuss its various applications. The PDD is a double-loop iterative algorithm. Its inner iteration is used to inexactly solve a nonconvex nonsmooth augmented Lagrangian problem via block-coordinate-descent-type methods, while its outer iteration updates the dual variables and/or a penalty parameter. In Part I of this work, we describe the PDD algorithm and establish its convergence to KKT solutions. In Part II we evaluate the performance of PDD by customizing it to three applications arising from signal processing and wireless communications.
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., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
Aharon, M., Elad, M., & Bruckstein, A. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881199 · Cited by 9,451
Multiplier and gradient methods
Hestenes, M. R. (1969) · Journal of Optimization Theory and Applications · doi:10.1007/bf00927673 · Cited by 2,446
Shi, Q., Razaviyayn, M., Luo, Z.-Q., & He, C. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2147784 · Cited by 2,129
Self-citationParlar, M. (2000) · Interactive Operations Research with Maple · doi:10.1007/978-1-4612-1356-7_5 · Cited by 1,741
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Bolte, J., Sabach, S., & Teboulle, M. (2014) · Mathematical Programming · doi:10.1007/s10107-013-0701-9 · Cited by 1,688
A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
Razaviyayn, M., Hong, M., & Luo, Z.-Q. (2013) · SIAM Journal on Optimization · doi:10.1137/120891009 · Cited by 1,304
Self-citationGlobal Convergence of ADMM in Nonconvex Nonsmooth Optimization
Wang, Y., Yin, W., & Zeng, J. (2019) · Journal of Scientific Computing · doi:10.1007/s10915-018-0757-z · Cited by 1,268
Generalized gradients and applications
Clarke, F. H. (1975) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1975-0367131-6 · Cited by 1,206
Yuille, A. L., & Rangarajan, A. (2003) · Neural Computation · doi:10.1162/08997660360581958 · Cited by 1,151 · cited 1×
“For example, when some inequality constraint g j ( x j ) ≤ 0 is complicated, we can use concave-convex procedure [58], [59] to address the AL problem, i.e., we can replace g j ( x j ) with its simple upper bound function [60] and solve the resulting problem (which is often easier) instead of the AL…”
Method(2011) · Encyclopedia of Machine Learning · doi:10.1007/978-0-387-30164-8_588 · Cited by 950
Hong, M., Luo, Z.-Q., & Razaviyayn, M. (2016) · SIAM Journal on Optimization · doi:10.1137/140990309 · Cited by 841
Self-citationHong, M., Razaviyayn, M., Luo, Z.-Q., & Pang, J.-S. (2016) · IEEE Signal Processing Magazine · doi:10.1109/msp.2015.2481563 · Cited by 447
Self-citationMulti-Agent Distributed Optimization via Inexact Consensus ADMM
Chang, T.-H., Hong, M., & Wang, X. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2367458 · Cited by 444
Self-citationSparse Beamforming and User-Centric Clustering for Downlink Cloud Radio Access Network
Dai, B., & Yu, W. (2014) · IEEE Access · doi:10.1109/access.2014.2362860 · Cited by 383
An alternating direction algorithm for matrix completion with nonnegative factors
Xu, Y., Yin, W., Wen, Z., & Zhang, Y. (2012) · Frontiers of Mathematics in China · doi:10.1007/s11464-012-0194-5 · Cited by 339
Global Convergence of Splitting Methods for Nonconvex Composite Optimization
Li, G., & Pong, T. K. (2015) · SIAM Journal on Optimization · doi:10.1137/140998135 · Cited by 315
Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
Scutari, G., Facchinei, F., & Lampariello, L. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2637317 · Cited by 314
Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
Gasso, G., Rakotomamonjy, A., & Canu, S. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2026004 · Cited by 304
Distributed Robust Multicell Coordinated Beamforming With Imperfect CSI: An ADMM Approach
Shen, C., Chang, T.-H., Wang, K.-Y., Qiu, Z., & Chi, C.-Y. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2188719 · Cited by 282
Hyperspectral Unmixing With Spectral Variability Using a Perturbed Linear Mixing Model
Thouvenin, P.-A., Dobigeon, N., & Tourneret, J.-Y. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2486746 · Cited by 230
SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
Kuang, D., Yun, S., & Park, H. (2015) · Journal of Global Optimization · doi:10.1007/s10898-014-0247-2 · Cited by 227
Tran-Dinh, Q., Gümüşsoy, S., Michiels, W., & Diehl, M. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2176154 · Cited by 213
Robust QoS-Constrained Optimization of Downlink Multiuser MISO Systems
Vucic, N., & Boche, H. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2008553 · Cited by 198
Sparse Approximation via Penalty Decomposition Methods
Lu, Z., & Zhang, Y. (2013) · SIAM Journal on Optimization · doi:10.1137/100808071 · Cited by 191
A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization
Huang, K., Sidiropoulos, N. D., & Liavas, A. P. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2576427 · Cited by 172
Parallel Selective Algorithms for Nonconvex Big Data Optimization
Facchinei, F., Scutari, G., & Sagratella, S. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2399858 · Cited by 162
Sun, D. L., & Févotte, C. (2014) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2014.6854796 · Cited by 153
Ruszczyński, A. (2011) · Princeton University Press eBooks · doi:10.2307/j.ctvcm4hcj · Cited by 120
Liao, W.-C., Hong, M., Liu, Y.-F., & Luo, Z.-Q. T. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2331611 · Cited by 96
Self-citationFernández, D., & Solodov, M. V. (2012) · SIAM Journal on Optimization · doi:10.1137/10081085x · Cited by 87
Cooperative Algorithms for MIMO Amplify-and-Forward Relay Networks
Truong, K. T., Sartori, P., & Heath, R. W. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2236832 · Cited by 81
Min Flow Rate Maximization for Software Defined Radio Access Networks
Liao, W.-C., Hong, M., Farmanbar, H., Li, X., Luo, Z.-Q. T., & Zhang, H. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.2328171 · Cited by 71
Self-citationJoint Source-Relay Design for Full-Duplex MIMO AF Relay Systems
Shi, Q., Hong, M., Gao, X., Song, E., Cai, Y., & Xu, W. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2605074 · Cited by 71
Self-citationLeinonen, M., Codreanu, M., & Juntti, M. J. (2013) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2013.100213.121227 · Cited by 70
Shi, Q., Razaviyayn, M., Hong, M., et al. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2529590 · Cited by 60
Self-citationFacchinei, F., Kungurtsev, V., Lampariello, L., & Scutari, G. (2021) · Mathematics of Operations Research · doi:10.1287/moor.2020.1079 · Cited by 33
Alternating direction method of multipliers for penalized zero-variance discriminant analysis
Ames, B., & Hong, M. (2016) · Computational Optimization and Applications · doi:10.1007/s10589-016-9828-y · Cited by 32
Self-citationFeasible methods for nonconvex nonsmooth problems with applications in green communications
Facchinei, F., Lampariello, L., & Scutari, G. (2016) · Mathematical Programming · doi:10.1007/s10107-016-1072-9 · Cited by 27
Cited by
Intelligent Reflecting Surface Enhanced Wireless Networks: Two-Timescale Beamforming Optimization
Zhao, M.-M., Wu, Q., Zhao, M.-J., & Zhang, R. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3022297 · Cited by 340
Metadata
- Authors
- Shi, Q., & Hong, M.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2020
- Volume
- 68
- Pages
- 4108-4122
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W3036056878
- Cited by
- 283
- References
- 41
- FWCI
- 15.35
- Type
- journal article
- Language
- en
- Open access
- closed
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.