A conjugate gradient algorithm without Lipchitz continuity and its applications

DOI10.1007/S12190-024-02088-2MaRDI QIDQ6586131zbMATH OpenFDO

Authors Huiyun Liu, Haishan Feng

Publication date 12 August 2024

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12190-024-02088-2

zbMATH Keywords

conjugate gradientglobal convergenceimage restorationnonsmooth

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Cites work

• A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
• A class of parameter estimation methods for nonlinear Muskingum model using hybrid invasive weed optimization algorithm
• A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications
• A modified Hestense-Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method
• A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
• A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
• Adaptive scaling damped BFGS method without gradient Lipschitz continuity
• Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions
• Benchmarking optimization software with performance profiles.
• Conjugate Gradient Methods with Inexact Searches
• Convergence analysis of a modified BFGS method on convex minimizations
• The global convergence of the BFGS method with a modified WWP line search for nonconvex functions
• Trust Region Methods

This page was built for publication: A conjugate gradient algorithm without Lipchitz continuity and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586131)