An efficient conjugate gradient method for nonsmooth optimization problems and its application in image restoration

Articles in Press

Document Type : Original Article

Authors

Department of Applied Mathematics, Faculty of Mathematical Sciences, University of Mazandran, Babolsar, Iran

Abstract

In this paper, an efficient conjugate gradient method is introduced for solving unconstrained nonsmooth optimization problems. Conjugate gradient methods are among the most popular methods for solving smooth optimization problems due to their simplicity and low memory requirements; however, their application to nonsmooth problems has received less attention. Therefore, the Lipschitz continuous objective function is first smoothed using the Moreau–Yosida regularization function. Then, a new descent direction is proposed by combining the first-order derivative information of the smoothed function with the previous descent direction. Using an inexact line search technique, it is shown that the generated direction satisfies the sufficient decrease condition and that the new iterate lies within a suitable trust region relative to the previous iterate. Moreover, the global convergence of the proposed method is guaranteed under standard assumptions. Finally, the effectiveness of this method is evaluated in the field of image recovery, and the results demonstrate its superior performance compared to existing methods.

Keywords

Main Subjects

Soft Computing Journal

Articles in Press, Accepted Manuscript
Available Online from 14 April 2025

Files

History

  • Receive Date: 24 November 2024
  • Revise Date: 14 January 2025
  • Accept Date: 26 February 2025

Share

How to cite

Statistics