Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
From MaRDI portal
Publication:2433993
DOI10.1007/s00211-006-0028-zzbMath1103.65074OpenAlexW2059012394MaRDI QIDQ2433993
Weijun Zhou, Li Zhang, Dong-hui Li
Publication date: 31 October 2006
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-006-0028-z
unconstrained optimizationconvergencenumerical resultsconjugate gradient methodsArmijo-type line searchFletcher-Reeves method
Related Items
Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination ⋮ An accelerated descent CG algorithm with clustering the eigenvalues for large-scale nonconvex unconstrained optimization and its application in image restoration problems ⋮ A modified conjugate gradient parameter via hybridization approach for solving large-scale systems of nonlinear equations ⋮ A structured Fletcher-Revees spectral conjugate gradient method for unconstrained optimization with application in robotic model ⋮ A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem ⋮ Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization ⋮ Modified Dai-Zuan iterative scheme for nonlinear systems and its application ⋮ A derivative‐free projection method for nonlinear equations with non‐Lipschitz operator: Application to LASSO problem ⋮ A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints ⋮ Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization ⋮ Time‐delay and parameter estimation for an ARX model based on copula theory and Armijo criterion and their applications in the modeling of the dynamics of the UAV ⋮ AN EFFICIENT METHOD FOR SOLVING A CLASS OF MATRIX TRACE FUNCTION MINIMIZATION PROBLEM IN MULTIVARIATE STATISTICAL ⋮ Unnamed Item ⋮ A family of quasi-Newton methods for unconstrained optimization problems ⋮ A globally convergent gradient-like method based on the Armijo line search ⋮ An Inexact PRP Conjugate Gradient Method for Symmetric Nonlinear Equations ⋮ An efficient hybrid conjugate gradient method for unconstrained optimization ⋮ Some descent three-term conjugate gradient methods and their global convergence ⋮ Unnamed Item ⋮ A spectral KRMI conjugate gradient method under the strong-Wolfe line search ⋮ A new spectral conjugate gradient method for large-scale unconstrained optimization ⋮ Spectral method and its application to the conjugate gradient method ⋮ A descent hybrid conjugate gradient method based on the memoryless BFGS update ⋮ An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ A conjugate gradient type method for the nonnegative constraints optimization problems ⋮ Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing ⋮ Sufficient descent nonlinear conjugate gradient methods with conjugacy condition ⋮ A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems ⋮ A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems ⋮ A modified Dai-Kou-type method with applications to signal reconstruction and blurred image restoration ⋮ The solution of two-phase inverse Stefan problem based on a hybrid method with optimization ⋮ An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems ⋮ A new smoothing spectral conjugate gradient method for solving tensor complementarity problems ⋮ New spectral PRP conjugate gradient method for unconstrained optimization ⋮ The convergence rate of a restart MFR conjugate gradient method with inexact line search ⋮ Further comment on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei ⋮ A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization ⋮ A simple sufficient descent method for unconstrained optimization ⋮ A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence ⋮ A new descent memory gradient method and its global convergence ⋮ Global convergence of a nonlinear conjugate gradient method ⋮ Global convergence of a modified spectral conjugate gradient method ⋮ A variant spectral-type FR conjugate gradient method and its global convergence ⋮ A new conjugate gradient algorithm for training neural networks based on a modified secant equation ⋮ Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping ⋮ \(n\)-step quadratic convergence of the MPRP method with a restart strategy ⋮ A spectral conjugate gradient method for solving large-scale unconstrained optimization ⋮ Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization ⋮ Globally convergent modified Perry's conjugate gradient method ⋮ A mixed spectral CD-DY conjugate gradient method ⋮ Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems ⋮ Global convergence of a spectral conjugate gradient method for unconstrained optimization ⋮ Global convergence of some modified PRP nonlinear conjugate gradient methods ⋮ Unnamed Item ⋮ An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints ⋮ Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization ⋮ A modified conjugacy condition and related nonlinear conjugate gradient method ⋮ Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization ⋮ Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems ⋮ An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization ⋮ New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods ⋮ An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method ⋮ An extension of the Fletcher-Reeves method to linear equality constrained optimization problem ⋮ PRP-like algorithm for monotone operator equations ⋮ New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction ⋮ FR type methods for systems of large-scale nonlinear monotone equations ⋮ A new class of nonmonotone conjugate gradient training algorithms ⋮ Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets ⋮ A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations ⋮ Global convergence of a modified spectral FR conjugate gradient method ⋮ A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method ⋮ Norm descent conjugate gradient methods for solving symmetric nonlinear equations ⋮ A limited memory descent Perry conjugate gradient method ⋮ A derivative-free conjugate gradient method and its global convergence for solving symmetric nonlinear equations ⋮ Conjugate gradient methods using value of objective function for unconstrained optimization ⋮ A modified CG-DESCENT method for unconstrained optimization ⋮ A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing ⋮ Two descent hybrid conjugate gradient methods for optimization ⋮ Sufficient descent directions in unconstrained optimization ⋮ Convergence properties of an iterative method for solving symmetric non-linear equations ⋮ A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem ⋮ Some nonlinear conjugate gradient methods based on spectral scaling secant equations ⋮ A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization ⋮ A class of modified FR conjugate gradient method and applications to non-negative matrix factorization ⋮ A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations ⋮ A Riemannian Fletcher--Reeves Conjugate Gradient Method for Doubly Stochastic Inverse Eigenvalue Problems ⋮ Nonstationary iterated Tikhonov regularization in Banach spaces with uniformly convex penalty terms ⋮ Spectral modified Polak-Ribiére-Polyak projection conjugate gradient method for solving monotone systems of nonlinear equations ⋮ A class of derivative-free CG projection methods for nonsmooth equations with an application to the LASSO problem ⋮ Some sufficient descent conjugate gradient methods and their global convergence ⋮ Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping ⋮ A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization ⋮ A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems ⋮ A spectral three-term Hestenes-Stiefel conjugate gradient method ⋮ A limited memory BFGS-type method for large-scale unconstrained optimization ⋮ A sufficient descent Liu–Storey conjugate gradient method and its global convergence ⋮ A sufficient descent nonlinear conjugate gradient method for solving \(\mathcal{M} \)-tensor equations ⋮ Modified three-term conjugate gradient method and its applications ⋮ Two modified Dai-Yuan nonlinear conjugate gradient methods ⋮ An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization ⋮ A conjugate gradient algorithm and its applications in image restoration ⋮ A conjugate gradient method with sufficient descent property ⋮ Modified HS conjugate gradient method for solving generalized absolute value equations ⋮ Least-squares-based three-term conjugate gradient methods ⋮ The new spectral conjugate gradient method for large-scale unconstrained optimisation ⋮ Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization ⋮ Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems ⋮ A derivative-free trust-region algorithm with copula-based models for probability maximization problems ⋮ An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation ⋮ A modified bat algorithm with conjugate gradient method for global optimization ⋮ Global convergence of Riemannian line search methods with a Zhang-Hager-type condition ⋮ A MODIFIED PROJECTED CONJUGATE GRADIENT ALGORITHM FOR UNCONSTRAINED OPTIMIZATION PROBLEMS ⋮ Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems ⋮ A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction ⋮ A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method ⋮ Two classes of spectral conjugate gradient methods for unconstrained optimizations ⋮ A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions ⋮ Two spectral conjugate gradient methods for unconstrained optimization problems ⋮ A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations ⋮ A modified Perry conjugate gradient method and its global convergence
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the limited memory BFGS method for large scale optimization
- Global convergence result for conjugate gradient methods
- Optimization. Algorithms and consistent approximations
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- Scaled conjugate gradient algorithms for unconstrained optimization
- Convergence Properties of Algorithms for Nonlinear 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
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Testing Unconstrained Optimization Software
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- CUTE
- Line search algorithms with guaranteed sufficient decrease
- Convergence properties of the Fletcher-Reeves method
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- 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.
- Global convergence of conjugate gradient methods without line search
