A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
From MaRDI portal
Publication:2072782
DOI10.1186/s13660-021-02554-6zbMath1504.65128OpenAlexW3126913104MaRDI QIDQ2072782
Bhagwat Ram, Mohammad Esmael Samei, Suvra Kanti Chakraborty, Shashi Kant Mishra
Publication date: 26 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-021-02554-6
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) (q)-calculus and related topics (05A30) Methods of reduced gradient type (90C52)
Related Items (4)
Time accurate solution to Benjamin-Bona-Mahony-Burgers equation via Taylor-Boubaker series scheme ⋮ Using \(\rho \)-cone arcwise connectedness on parametric set-valued optimization problems ⋮ Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization ⋮ On the convergence rate of Fletcher‐Reeves nonlinear conjugate gradient methods satisfying strong Wolfe conditions: Application to parameter identification in problems governed by general dynamics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global optimization using \(q\)-gradients
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- A globally convergent version of the Polak-Ribière conjugate gradient method
- A modified nonlinear conjugate gradient method with the Armijo line search and its application
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems
- A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration
- Existence of solutions for equations and inclusions of multiterm fractional \(q\)-integro-differential with nonseparated and initial boundary conditions
- Estimates of quantum bounds pertaining to new \(q\)-integral identity with applications
- On \(q\)-steepest descent method for unconstrained multiobjective optimization problems
- New approach to solutions of a class of singular fractional \(q\)-differential problem via quantum calculus
- Existence of solutions for a system of singular sum fractional \(q\)-differential equations via quantum calculus
- Nonlinear conjugate gradient methods for unconstrained optimization
- The projection technique for two open problems of unconstrained optimization problems
- Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration
- A sufficient descent nonlinear conjugate gradient method for solving \(\mathcal{M} \)-tensor equations
- The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
- Minimization of functions having Lipschitz continuous first partial derivatives
- Existence results for a fraction hybrid differential inclusion with Caputo-Hadamard type fractional derivative
- Convergence Properties of Algorithms for Nonlinear Optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A Method for q-Calculus
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Applications of q-Calculus in Operator Theory
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Newton Like Line Search Method Using q-Calculus
- Solutions of sum‐type singular fractional q integro‐differential equation with m‐point boundary value problem using quantum calculus
- Introduction to Unconstrained Optimization with R
- The q-Gradient Vector for Unconstrained Continuous Optimization Problems
- Function minimization by conjugate gradients
- CUTEr and SifDec
- Convergence Conditions for Ascent Methods. II: Some Corrections
- On Steepest Descent
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
This page was built for publication: A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
