Guardado en:
Detalles Bibliográficos
Autores principales: Loreto, Milagros, Humphries, Thomas, Raghavan, Chella, Wu, Kenneth, Kwak, Sam
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:https://arxiv.org/abs/2309.15266
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866912636688400384
author Loreto, Milagros
Humphries, Thomas
Raghavan, Chella
Wu, Kenneth
Kwak, Sam
author_facet Loreto, Milagros
Humphries, Thomas
Raghavan, Chella
Wu, Kenneth
Kwak, Sam
contents A new spectral conjugate subgradient method is presented to solve nonsmooth unconstrained optimization problems. The method combines the spectral conjugate gradient method for smooth problems with the spectral subgradient method for nonsmooth problems. We study the effect of two different choices of line search, as well as three formulas for determining the conjugate directions. In addition to numerical experiments with standard nonsmooth test problems, we also apply the method to several image reconstruction problems in computed tomography, using total variation regularization. Performance profiles are used to compare the performance of the algorithm using different line search strategies and conjugate directions to that of the original spectral subgradient method. Our results show that the spectral conjugate subgradient algorithm outperforms the original spectral subgradient method, and that the use of the Polak-Ribiere formula for conjugate directions provides the best and most robust performance.
format Preprint
id arxiv_https___arxiv_org_abs_2309_15266
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle A New Spectral Conjugate Subgradient Method with Application in Computed Tomography Image Reconstruction
Loreto, Milagros
Humphries, Thomas
Raghavan, Chella
Wu, Kenneth
Kwak, Sam
Optimization and Control
90C30, 90C56, 94A08
A new spectral conjugate subgradient method is presented to solve nonsmooth unconstrained optimization problems. The method combines the spectral conjugate gradient method for smooth problems with the spectral subgradient method for nonsmooth problems. We study the effect of two different choices of line search, as well as three formulas for determining the conjugate directions. In addition to numerical experiments with standard nonsmooth test problems, we also apply the method to several image reconstruction problems in computed tomography, using total variation regularization. Performance profiles are used to compare the performance of the algorithm using different line search strategies and conjugate directions to that of the original spectral subgradient method. Our results show that the spectral conjugate subgradient algorithm outperforms the original spectral subgradient method, and that the use of the Polak-Ribiere formula for conjugate directions provides the best and most robust performance.
title A New Spectral Conjugate Subgradient Method with Application in Computed Tomography Image Reconstruction
topic Optimization and Control
90C30, 90C56, 94A08
url https://arxiv.org/abs/2309.15266