A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property
From MaRDI portal
Publication:2201566
DOI10.1007/S10092-020-00378-2zbMATH Open1451.90152OpenAlexW3080783123MaRDI QIDQ2201566FDOQ2201566
Publication date: 29 September 2020
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-020-00378-2
Recommendations
- Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems
- Two modified Polak-Ribière-Polyak-type nonlinear conjugate methods with sufficient descent property
- Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization
global convergencesufficient descent conditionnumerical comparisonPolak-Ribière-Polyak conjugate gradient method
Cites Work
- Benchmarking optimization software with performance profiles.
- Function minimization by conjugate gradients
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- An unconstrained optimization test functions collection
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Two-Term PRP-Based Descent Method
- Convergence Conditions for Ascent Methods
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Title not available (Why is that?)
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
- A class of globally convergent three-term Dai-Liao conjugate gradient methods
Cited In (10)
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- Title not available (Why is that?)
- Two spectral conjugate gradient methods for unconstrained optimization problems
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update
- A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
- Title not available (Why is that?)
- An adaptive descent extension of the Polak–Rebière–Polyak conjugate gradient method based on the concept of maximum magnification
- A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems
This page was built for publication: A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201566)
