Optimizing ADMM and Over-Relaxed ADMM Parameters for Linear Quadratic Problems
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913182128275456 |
|---|---|
| author | Song, Jintao Lu, Wenqi Lei, Yunwen Tang, Yuchao Pan, Zhenkuan Duan, Jinming |
| author_facet | Song, Jintao Lu, Wenqi Lei, Yunwen Tang, Yuchao Pan, Zhenkuan Duan, Jinming |
| contents | The Alternating Direction Method of Multipliers (ADMM) has gained significant attention across a broad spectrum of machine learning applications. Incorporating the over-relaxation technique shows potential for enhancing the convergence rate of ADMM. However, determining optimal algorithmic parameters, including both the associated penalty and relaxation parameters, often relies on empirical approaches tailored to specific problem domains and contextual scenarios. Incorrect parameter selection can significantly hinder ADMM's convergence rate. To address this challenge, in this paper we first propose a general approach to optimize the value of penalty parameter, followed by a novel closed-form formula to compute the optimal relaxation parameter in the context of linear quadratic problems (LQPs). We then experimentally validate our parameter selection methods through random instantiations and diverse imaging applications, encompassing diffeomorphic image registration, image deblurring, and MRI reconstruction. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_00657 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimizing ADMM and Over-Relaxed ADMM Parameters for Linear Quadratic Problems Song, Jintao Lu, Wenqi Lei, Yunwen Tang, Yuchao Pan, Zhenkuan Duan, Jinming Optimization and Control Computer Vision and Pattern Recognition Spectral Theory The Alternating Direction Method of Multipliers (ADMM) has gained significant attention across a broad spectrum of machine learning applications. Incorporating the over-relaxation technique shows potential for enhancing the convergence rate of ADMM. However, determining optimal algorithmic parameters, including both the associated penalty and relaxation parameters, often relies on empirical approaches tailored to specific problem domains and contextual scenarios. Incorrect parameter selection can significantly hinder ADMM's convergence rate. To address this challenge, in this paper we first propose a general approach to optimize the value of penalty parameter, followed by a novel closed-form formula to compute the optimal relaxation parameter in the context of linear quadratic problems (LQPs). We then experimentally validate our parameter selection methods through random instantiations and diverse imaging applications, encompassing diffeomorphic image registration, image deblurring, and MRI reconstruction. |
| title | Optimizing ADMM and Over-Relaxed ADMM Parameters for Linear Quadratic Problems |
| topic | Optimization and Control Computer Vision and Pattern Recognition Spectral Theory |
| url | https://arxiv.org/abs/2401.00657 |