A conjugate gradient algorithm without Lipchitz continuity and its applications
From MaRDI portal
Publication:6586131
DOI10.1007/S12190-024-02088-2MaRDI QIDQ6586131
Publication date: 12 August 2024
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Cites Work
- Convergence analysis of a modified BFGS method on convex minimizations
- 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
- Adaptive scaling damped BFGS method without gradient Lipschitz continuity
- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions
- The global convergence of the BFGS method with a modified WWP line search for nonconvex functions
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- Conjugate Gradient Methods with Inexact Searches
- Trust Region Methods
- A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
- Benchmarking optimization software with performance profiles.
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)