The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Global Convergence of Splitting Methods for Nonconvex Composite Optimization
Open accessAbstract
We consider the problem of minimizing the sum of a smooth function $h$ with a bounded Hessian and a nonsmooth function. We assume that the latter function is a composition of a proper closed function $P$ and a surjective linear map $\mathcal{M}$, with the proximal mappings of $\tau P$, $\tau > 0$, simple to compute. This problem is nonconvex in general and encompasses many important applications in engineering and machine learning. In this paper, we examined two types of splitting methods for solving this nonconvex optimization problem: the alternating direction method of multipliers and the proximal gradient algorithm. For the direct adaptation of the alternating direction method of multipliers, we show that if the penalty parameter is chosen sufficiently large and the sequence generated has a cluster point, then it gives a stationary point of the nonconvex problem. We also establish convergence of the whole sequence under an additional assumption that the functions $h$ and $P$ are semialgebraic. Furthermore, we give simple sufficient conditions to guarantee boundedness of the sequence generated. These conditions can be satisfied for a wide range of applications including the least squares problem with the $\ell_{1/2}$ regularization. Finally, when $\mathcal{M}$ is the identity so that the proximal gradient algorithm can be efficiently applied, we show that any cluster point is stationary under a slightly more flexible constant step-size rule than what is known in the literature for a nonconvex $h$.
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
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Eckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Wang, Y., Yang, J., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/080724265 · Cited by 1,975 · cited 1×
“This has been widely used recently; see, for example [10, 11, 33, 34, 36].”
Attouch, H., Bolte, J., & Svaiter, B. F. (2013) · Mathematical Programming · doi:10.1007/s10107-011-0484-9 · Cited by 1,414
Iterative Thresholding for Sparse Approximations
Blumensath, T., & Davies, M. E. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9035-z · Cited by 1,248
Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
Yang, J., & Zhang, Y. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090777761 · Cited by 1,201
Attouch, H., Bolte, J., Redont, P., & Soubeyran, A. (2010) · Mathematics of Operations Research · doi:10.1287/moor.1100.0449 · Cited by 1,172
Bolte, J., Daniilidis, A., & Lewis, A. (2007) · SIAM Journal on Optimization · doi:10.1137/050644641 · Cited by 671
Tseng, P. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329006 · Cited by 467
Alternating direction augmented Lagrangian methods for semidefinite programming
Wen, Z., Goldfarb, D., & Yin, W. (2010) · Mathematical Programming Computation · doi:10.1007/s12532-010-0017-1 · Cited by 359
Matrix completion via an alternating direction method
Chen, C., He, B., & Yuan, X. (2012) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drq039 · Cited by 188
A generalized proximal point algorithm for certain non-convex minimization problems
FUKUSHIMA, M., & MINE, H. (1981) · International Journal of Systems Science · doi:10.1080/00207728108963798 · Cited by 166
Zeng, J., Lin, S., Wang, Y., & Xu, Z. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2309076 · Cited by 160
Alternating Direction Method for Image Inpainting in Wavelet Domains
Chan, R. H., Yang, J., & Yuan, X. (2011) · SIAM Journal on Imaging Sciences · doi:10.1137/100807247 · Cited by 103
X-Ray CT Image Reconstruction via Wavelet Frame Based Regularization and Radon Domain Inpainting
Dong, B., Li, J., & Shen, Z. (2012) · Journal of Scientific Computing · doi:10.1007/s10915-012-9579-6 · Cited by 88
Cited by
Global 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
Modern regularization methods for inverse problems
Benning, M., & Burger, M. (2018) · Acta Numerica · doi:10.1017/s0962492918000016 · Cited by 412
Shi, Q., & Hong, M. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3001906 · Cited by 283
Metadata
- Authors
- Li, G., & Pong, T. K.
- Venue
- SIAM Journal on Optimization
- Published
- 2015-01
- Volume
- 25
- Issue
- 4
- Pages
- 2434-2460
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2163232332
- Cited by
- 315
- References
- 17
- FWCI
- 20.96
- 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.