The DOI matches its Crossref record; 1 of the 1 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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
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
- 1
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality. https://app.cochat.ai/papers/10.1287/moor.1100.0449
- The paper
- Attouch, H., Bolte, J., Redont, P., & Soubeyran, A. (2010). Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality. Mathematics of Operations Research. https://doi.org/10.1287/moor.1100.0449
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.