Cargando…

A new smoothing modified three-term conjugate gradient method for [Formula: see text] -norm minimization problem

We consider a kind of nonsmooth optimization problems with [Formula: see text] -norm minimization, which has many applications in compressed sensing, signal reconstruction, and the related engineering problems. Using smoothing approximate techniques, this kind of nonsmooth optimization problem can b...

Descripción completa

Detalles Bibliográficos
Autores principales: Du, Shouqiang, Chen, Miao
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2018
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5934501/
https://www.ncbi.nlm.nih.gov/pubmed/29755245
http://dx.doi.org/10.1186/s13660-018-1696-9
Descripción
Sumario:We consider a kind of nonsmooth optimization problems with [Formula: see text] -norm minimization, which has many applications in compressed sensing, signal reconstruction, and the related engineering problems. Using smoothing approximate techniques, this kind of nonsmooth optimization problem can be transformed into a general unconstrained optimization problem, which can be solved by the proposed smoothing modified three-term conjugate gradient method. The smoothing modified three-term conjugate gradient method is based on Polak–Ribière–Polyak conjugate gradient method. For the Polak–Ribière–Polyak conjugate gradient method has good numerical properties, the proposed method possesses the sufficient descent property without any line searches, and it is also proved to be globally convergent. Finally, the numerical experiments show the efficiency of the proposed method.