The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
Abstract
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x,y)=f(x)+Q(x,y)+g(y), where f and g are proper lower semicontinuous functions, defined on Euclidean spaces, and Q is a smooth function that couples the variables x and y. The algorithm can be viewed as a proximal regularization of the usual Gauss-Seidel method to minimize L. We work in a nonconvex setting, just assuming that the function L satisfies the Kurdyka-Łojasiewicz inequality. An entire section illustrates the relevancy of such an assumption by giving examples ranging from semialgebraic geometry to “metrically regular” problems. Our main result can be stated as follows: If L has the Kurdyka-Łojasiewicz property, then each bounded sequence generated by the algorithm converges to a critical point of L. This result is completed by the study of the convergence rate of the algorithm, which depends on the geometrical properties of the function L around its critical points. When specialized to [Formula: see text] and to f, g indicator functions, the algorithm is an alternating projection mehod (a variant of von Neumann's) that converges for a wide class of sets including semialgebraic and tame sets, transverse smooth manifolds or sets with “regular” intersection. To illustrate our results with concrete problems, we provide a convergent proximal reweighted ℓ 1 algorithm for compressive sensing and an application to rank reduction problems.
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
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
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
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
The Geometry of Algorithms with Orthogonality Constraints
Edelman, A., Arias, T. A., & Smith, S. T. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895290954 · Cited by 2,685
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization
Tseng, P. (2001) · Journal of Optimization Theory and Applications · doi:10.1023/a:1017501703105 · Cited by 1,989
Bernstein, D. L. (1951) · Princeton University Press eBooks · doi:10.1515/9781400882229-003 · Cited by 1,914
(2002) · Springer eBooks · doi:10.1007/b114992 · Cited by 1,881
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
On Projection Algorithms for Solving Convex Feasibility Problems
Bauschke, H. H., & Borwein, J. M. (1996) · SIAM Review · doi:10.1137/s0036144593251710 · Cited by 1,654
Bochnak, J., Coste, M., & Roy, M.-F. (1998) · Springer · doi:10.1007/978-3-662-03718-8 · Cited by 1,538 · cited 1×
“[13]); the following few facts might help the reader to understand how they impact optimization matters: —finite sums and products of semialgebraic functions are semialgebraic; —scalar products are semialgebraic; —indicator functions of semialgebraic sets are semialgebraic; —generalized inverse of semialgebraic mappin…”
Background(2014) · Choice Reviews Online · doi:10.5860/choice.51-3296 · Cited by 1,260
Bolte, J., Daniilidis, A., & Lewis, A. (2007) · SIAM Journal on Optimization · doi:10.1137/050644641 · Cited by 671
Self-citationWidrow, B., & Bilello, M. (2002) · Proceedings of 8th IEEE International Symposium on Intelligent Control · doi:10.1109/isic.1993.397732 · Cited by 594
Information geometry and alternating minimization procedures
Csiszár, I. (1984) · Statistics & Risk Modeling · Cited by 579
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
Attouch, H., & Bolte, J. (2007) · Mathematical Programming · doi:10.1007/s10107-007-0133-5 · Cited by 568
Self-citationOn gradients of functions definable in o-minimal structures
Kurdyka, K. (1998) · Annales de l'Institut Fourier · doi:10.5802/aif.1638 · Cited by 461
Rogers, S. (1997) · Control Engineering Practice · doi:10.1016/s0967-0661(97)89242-8 · Cited by 326
Convergence of the Iterates of Descent Methods for Analytic Cost Functions
Absil, P. A., Mahony, R., & Andrews, B. (2005) · SIAM Journal on Optimization · doi:10.1137/040605266 · Cited by 291
Dixon, L. C. W., & Maine, R. E. (1975) · Journal of Dynamic Systems, Measurement, and Control · doi:10.1115/1.3426911 · Cited by 240
Alternating Projections on Manifolds
Lewis, A. S., & Malick, J. (2008) · Mathematics of Operations Research · doi:10.1287/moor.1070.0291 · Cited by 221
Optimisation : méthodes numériques
Auslender, A. (1976) · Masson eBooks · Cited by 210
Sur la géométrie semi- et sous- analytique
Łojasiewicz, S. (1993) · Annales de l'Institut Fourier · doi:10.5802/aif.1384 · Cited by 203
Geometry of Subanalytic and Semialgebraic Sets
Shiota, M. (1997) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-2008-4 · Cited by 200
Byrne, C. L., & Censor, Y. (2001) · Annals of Operations Research · doi:10.1023/a:1013349430987 · Cited by 79
Efficient Rank Reduction of Correlation Matrices 1Preprint
Pietersz, R., & Groenen, P. J. F. (2003) · Cited by 74
Complements of subanalytic sets and existential formulas for analytic functions
Gabrielov, A. M. (1996) · Inventiones mathematicae · doi:10.1007/s002220050066 · Cited by 67
Joint minimization with alternating Bregman proximity operators
Bauschke, H. H., Combettes, P. L., & Noll, D. (2005) · Cited by 60
A nonsmooth Morse–Sard theorem for subanalytic functions
Bolte, J., Daniilidis, A., & Lewis, A. S. (2005) · Journal of Mathematical Analysis and Applications · doi:10.1016/j.jmaa.2005.07.068 · Cited by 41
Self-citation
Cited by
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
Self-citationWright, S. J. (2015) · Mathematical Programming · doi:10.1007/s10107-015-0892-3 · Cited by 1,438
Attouch, H., Bolte, J., & Svaiter, B. F. (2013) · Mathematical Programming · doi:10.1007/s10107-011-0484-9 · Cited by 1,414
Self-citationXu, Y., & Yin, W. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120887795 · Cited by 1,160
Fusing Hyperspectral and Multispectral Images via Coupled Sparse Tensor Factorization
Li, S., Dian, R., Fang, L., & Bioucas-Dias, J. M. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2836307 · Cited by 585
Metadata
- Authors
- Attouch, H., Bolte, J., Redont, P., & Soubeyran, A.
- Venue
- Mathematics of Operations Research
- Published
- 2010-05
- Volume
- 35
- Issue
- 2
- Pages
- 438-457
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2129732816
- Cited by
- 1,172
- References
- 32
- FWCI
- 12.95
- 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.