A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update
From MaRDI portal
Publication:2052328
Recommendations
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property
- A descent hybrid modification of the Polak-Ribière-Polyak conjugate gradient method
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction
- A modified Polak-Ribière-Polyak descent method for unconstrained optimization
- An eigenvalue study on the sufficient descent property of a modified Polak-Ribière-Polyak conjugate gradient method
- A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems
Cites work
- A Berry-Esseen type bound for the kernel density estimator based on a weakly dependent and randomly left truncated data
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- 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
- A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A spectral conjugate gradient method for unconstrained optimization
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- A Two-Term PRP-Based Descent Method
- An optimal extension of the Polak-Ribière-Polyak conjugate gradient method
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- scientific article; zbMATH DE number 3363347 (Why is no real title available?)
- Line search algorithms with guaranteed sufficient decrease
- Methods of conjugate gradients for solving linear systems
- New spectral PRP conjugate gradient method for unconstrained optimization
- Nonlinear conjugate gradient methods for unconstrained optimization
- Optimal conditioning of self-scaling variable Metric algorithms
- Restart procedures for the conjugate gradient method
- Self-Scaling Variable Metric (SSVM) Algorithms
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The conjugate gradient method in extremal problems
- The strong convergence theorems for split common fixed point problem of asymptotically nonexpansive mappings in Hilbert spaces
- Two-Point Step Size Gradient Methods
Cited in
(6)- 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
- A convex combination of improved Fletcher-Reeves and Rivaie-Mustafa-Ismail-Leong conjugate gradient methods for unconstrained optimization problems and applications
- A projected hybridization of the Hestenes-Stiefel and Dai-Yuan conjugate gradient methods with application to nonnegative matrix factorization
- A spectral Hestenes-Stiefel CG algorithm for large-scale unconstrained optimization in image restoration problems
- A descent hybridization of the Polak–Ribière–Polyak and Fletcher–Reeves conjugate gradient methods with applications to nonnegative matrix factorization and compressive sensing
This page was built for publication: A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052328)