A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update

DOI10.1007/s40314-021-01662-9zbMath1476.65112OpenAlexW3206404612MaRDI QIDQ2052328

Maryam Khoshsimaye-Bargard, Ali Reza Ashrafi

Publication date: 25 November 2021

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-021-01662-9

zbMATH Keywords

unconstrained optimizationglobal convergencespectral conjugate gradient methodBFGS updatesufficient descent property

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53)

Related Items (2)

A family of the modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent and conjugacy conditions ⋮ A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method

Uses Software

• CUTEr

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong convergence theorems for split common fixed point problem of asymptotically nonexpansive mappings in Hilbert spaces
• A Berry-Esseen type bound for the kernel density estimator based on a weakly dependent and randomly left truncated data
• New spectral PRP conjugate gradient method for unconstrained optimization
• A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization
• Nonlinear conjugate gradient methods for unconstrained optimization
• A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
• A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
• A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Two-Point Step Size Gradient Methods
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Self-Scaling Variable Metric (SSVM) Algorithms
• Optimal conditioning of self-scaling variable Metric algorithms
• Restart procedures for the conjugate gradient method
• Line search algorithms with guaranteed sufficient decrease
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A new spectral conjugate gradient method for large-scale unconstrained optimization
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• An Optimal Extension of the Polak–Ribière–Polyak Conjugate Gradient Method
• A Two-Term PRP-Based Descent Method
• CUTEr and SifDec
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• A spectral conjugate gradient method for unconstrained optimization
• Benchmarking optimization software with performance profiles.

This page was built for publication: A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update