Journal article · 2024 · Open access
Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions
Journal of Optimization Theory and Applications, 203(2), 1622–1658 · Published 30 September 2024 · DOI 10.1007/s10957-024-02539-7
In brief
“Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions” is a 2024 journal article by Tan Nhat Pham and 3 co-authors, published in Journal of Optimization Theory and Applications. OpenAlex counts 8 citations as of 15 November 2026. It is open access under a CC BY licence: the full text is free to read at Journal of Optimization Theory and Applications.
- Citations
- 8
- Most cited in
- 2025 (4)
- Field-weighted impact
- 2.09
- References
- 30
- Authors
- 4
Abstract
In this paper, we develop a splitting algorithm incorporating Bregman distances to solve a broad class of linearly constrained composite optimization problems, whose objective function is the separable sum of possibly nonconvex nonsmooth functions and a smooth function, coupled by a difference of functions. This structure encapsulates numerous significant nonconvex and nonsmooth optimization problems in the current literature including the linearly constrained difference-of-convex problems. Relying on the successive linearization and alternating direction method of multipliers (ADMM), the proposed algorithm exhibits the global subsequential convergence to a stationary point of the underlying problem. We also establish the convergence of the full sequence generated by our algorithm under the Kurdyka–Łojasiewicz property and some mild assumptions. The efficiency of the proposed algorithm is tested on a robust principal component analysis problem and a nonconvex optimal power flow problem.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Pham, T. N., Dao, M. N., Eberhard, A. C., & Sultanova, N. (2024). Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions. Journal of Optimization Theory and Applications, 203(2), 1622–1658. https://doi.org/10.1007/s10957-024-02539-7
MLA 9
Pham, Tan Nhat, et al. “Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions.” Journal of Optimization Theory and Applications, vol. 203, no. 2, 2024, pp. 1622–1658. https://doi.org/10.1007/s10957-024-02539-7.
Chicago
Pham, Tan Nhat, Minh Ngoc Dao, Andrew C. Eberhard, and Nargiz Sultanova. 2024. “Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions.” Journal of Optimization Theory and Applications 203 (2): 1622–1658. https://doi.org/10.1007/s10957-024-02539-7.
Harvard
Pham, T. N. et al. (2024) ‘Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions’, Journal of Optimization Theory and Applications, 203(2), pp. 1622–1658. doi:10.1007/s10957-024-02539-7.
IEEE
T. N. Pham, M. N. Dao, A. C. Eberhard, and N. Sultanova, “Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions,” Journal of Optimization Theory and Applications, vol. 203, no. 2, pp. 1622–1658, 2024, doi: 10.1007/s10957-024-02539-7.
BibTeX
@article{pham2024bregman,
title = {{Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions}},
author = {Pham, Tan Nhat and Dao, Minh Ngoc and Eberhard, Andrew C. and Sultanova, Nargiz},
journal = {Journal of Optimization Theory and Applications},
year = {2024},
volume = {203},
number = {2},
pages = {1622--1658},
doi = {10.1007/s10957-024-02539-7},
url = {https://doi.org/10.1007/s10957-024-02539-7}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2024 | 1 | |
| 2025 | 4 | |
| 2026 | 3 |
Its field-weighted citation impact is 2.09: it has been cited 2.09 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- Bregman distance
- alternating direction method of multipliers
- difference of convex functions
- linearly constrained optimization
- composite optimization
- nonsmooth nonconvex optimization
- Kurdyka-Łojasiewicz property
- global convergence
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Pham, T. N., Dao, M. N., Eberhard, A. C., & Sultanova, N. (2024). Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions. Journal of Optimization Theory and Applications, 203(2), 1622–1658. https://doi.org/10.1007/s10957-024-02539-7
How many times has this paper been cited?
8 times, according to OpenAlex on 15 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access: read the free full text at Journal of Optimization Theory and Applications.
Who wrote this paper?
Tan Nhat Pham, Minh Ngoc Dao, Andrew C. Eberhard, Nargiz Sultanova.
What is the DOI of this paper?
10.1007/s10957-024-02539-7. The permanent link is https://doi.org/10.1007/s10957-024-02539-7.
Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.