A proximal splitting algorithm for generalized DC programming with applications in signal recovery
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909625669910528 |
|---|---|
| author | Pham, Tan Nhat Dao, Minh N. Amjady, Nima Shah, Rakibuzzaman |
| author_facet | Pham, Tan Nhat Dao, Minh N. Amjady, Nima Shah, Rakibuzzaman |
| contents | The difference-of-convex (DC) program is an important model in nonconvex optimization due to its structure, which encompasses a wide range of practical applications. In this paper, we aim to tackle a generalized class of DC programs, where the objective function is formed by summing a possibly nonsmooth nonconvex function and a differentiable nonconvex function with Lipschitz continuous gradient, and then subtracting a nonsmooth continuous convex function. We develop a proximal splitting algorithm that utilizes proximal evaluation for the concave part and Douglas--Rachford splitting for the remaining components. The algorithm guarantees subsequential convergence to a {\color{black}critical} point of the problem model. Under the widely used Kurdyka--Łojasiewicz property, we establish global convergence of the full sequence of iterates and derive convergence rates for both the iterates and the objective function values, without assuming the concave part is differentiable. The performance of the proposed algorithm is tested on signal recovery problems with a nonconvex regularization term and exhibits competitive results compared to notable algorithms in the literature on both synthetic data and real-world data. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_01535 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A proximal splitting algorithm for generalized DC programming with applications in signal recovery Pham, Tan Nhat Dao, Minh N. Amjady, Nima Shah, Rakibuzzaman Optimization and Control 90C26, 49M27, 65K05 The difference-of-convex (DC) program is an important model in nonconvex optimization due to its structure, which encompasses a wide range of practical applications. In this paper, we aim to tackle a generalized class of DC programs, where the objective function is formed by summing a possibly nonsmooth nonconvex function and a differentiable nonconvex function with Lipschitz continuous gradient, and then subtracting a nonsmooth continuous convex function. We develop a proximal splitting algorithm that utilizes proximal evaluation for the concave part and Douglas--Rachford splitting for the remaining components. The algorithm guarantees subsequential convergence to a {\color{black}critical} point of the problem model. Under the widely used Kurdyka--Łojasiewicz property, we establish global convergence of the full sequence of iterates and derive convergence rates for both the iterates and the objective function values, without assuming the concave part is differentiable. The performance of the proposed algorithm is tested on signal recovery problems with a nonconvex regularization term and exhibits competitive results compared to notable algorithms in the literature on both synthetic data and real-world data. |
| title | A proximal splitting algorithm for generalized DC programming with applications in signal recovery |
| topic | Optimization and Control 90C26, 49M27, 65K05 |
| url | https://arxiv.org/abs/2409.01535 |