New hybrid conjugate gradient method for nonlinear optimization with application to image restoration problems
Kybernetika, Tome 60 (2024) no. 4, pp. 535-552
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
The conjugate gradient method is one of the most effective algorithm for unconstrained nonlinear optimization problems. This is due to the fact that it does not need a lot of storage memory and its simple structure properties, which motivate us to propose a new hybrid conjugate gradient method through a convex combination of $\beta _{k}^{RMIL}$ and $\beta _{k}^{HS}$. We compute the convex parameter $\theta _{k}$ using the Newton direction. Global convergence is established through the strong Wolfe conditions. Numerical experiments show the superior efficiency of our algorithm to solve unconstrained optimization problem compared to other considered methods. Applied to image restoration problem, our algorithm is competitive with existing algorithms and performs even better when the level of noise in the image is significant.
The conjugate gradient method is one of the most effective algorithm for unconstrained nonlinear optimization problems. This is due to the fact that it does not need a lot of storage memory and its simple structure properties, which motivate us to propose a new hybrid conjugate gradient method through a convex combination of $\beta _{k}^{RMIL}$ and $\beta _{k}^{HS}$. We compute the convex parameter $\theta _{k}$ using the Newton direction. Global convergence is established through the strong Wolfe conditions. Numerical experiments show the superior efficiency of our algorithm to solve unconstrained optimization problem compared to other considered methods. Applied to image restoration problem, our algorithm is competitive with existing algorithms and performs even better when the level of noise in the image is significant.
DOI :
10.14736/kyb-2024-4-0535
Classification :
65K05, 90C26, 90C30
Keywords: unconstrained optimization; conjugate gradient method; descent direction; line search; image restoration
Keywords: unconstrained optimization; conjugate gradient method; descent direction; line search; image restoration
@article{10_14736_kyb_2024_4_0535,
author = {Hemici, Youcef Elhamam and Khelladi, Samia and Benterki, Djamel},
title = {New hybrid conjugate gradient method for nonlinear optimization with application to image restoration problems},
journal = {Kybernetika},
pages = {535--552},
year = {2024},
volume = {60},
number = {4},
doi = {10.14736/kyb-2024-4-0535},
mrnumber = {4811987},
zbl = {07953743},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.14736/kyb-2024-4-0535/}
}
TY - JOUR AU - Hemici, Youcef Elhamam AU - Khelladi, Samia AU - Benterki, Djamel TI - New hybrid conjugate gradient method for nonlinear optimization with application to image restoration problems JO - Kybernetika PY - 2024 SP - 535 EP - 552 VL - 60 IS - 4 UR - http://geodesic.mathdoc.fr/articles/10.14736/kyb-2024-4-0535/ DO - 10.14736/kyb-2024-4-0535 LA - en ID - 10_14736_kyb_2024_4_0535 ER -
%0 Journal Article %A Hemici, Youcef Elhamam %A Khelladi, Samia %A Benterki, Djamel %T New hybrid conjugate gradient method for nonlinear optimization with application to image restoration problems %J Kybernetika %D 2024 %P 535-552 %V 60 %N 4 %U http://geodesic.mathdoc.fr/articles/10.14736/kyb-2024-4-0535/ %R 10.14736/kyb-2024-4-0535 %G en %F 10_14736_kyb_2024_4_0535
Hemici, Youcef Elhamam; Khelladi, Samia; Benterki, Djamel. New hybrid conjugate gradient method for nonlinear optimization with application to image restoration problems. Kybernetika, Tome 60 (2024) no. 4, pp. 535-552. doi: 10.14736/kyb-2024-4-0535
Cité par Sources :