Export Mendeley
＜journal article＞
Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
| Creator | |
|---|---|
| Language | |
| Publisher | |
| Date | |
| Source Title | |
| Vol | |
| Issue | |
| First Page | |
| Last Page | |
| Publication Type | |
| Access Rights | |
| Related DOI | |
| Abstract | Although the performance of popular optimization algorithms such as the Douglas-Rachford splitting (DRS) and the ADMM is satisfactory in small and well-scaled problems, ill conditioning and problem si...ze pose a severe obstacle to their reliable employment. Expanding on recent convergence results for DRS and ADMM applied to nonconvex problems, we propose two linesearch algorithms to enhance and robustify these methods by means of quasi-Newton directions. The proposed algorithms are suited for nonconvex problems, require the same black-box oracle of DRS and ADMM, and maintain their (subsequential) convergence properties. Numerical evidence shows that the employment of L-BFGS in the proposed framework greatly improves convergence of DRS and ADMM, making them robust to ill conditioning. Under regularity and nondegeneracy assumptions at the limit point, superlinear convergence is shown when quasi-Newton Broyden directions are adopted.show more |
Hide fulltext details.
| File | FileType | Size | Views | Description |
|---|---|---|---|---|
4785265
|
494 KB | 125 |
Details
| PISSN | |
|---|---|
| EISSN | |
| NCID | |
| Record ID | |
| Subject Terms | |
| Funding Information | |
| Created Date | 2022.05.30 |
| Modified Date | 2023.05.11 |