Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
From MaRDI portal
Publication:2433993
Recommendations
- Global convergence of a modified FR conjugate gradient method
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Wolfe line search
- Global convergence of a new conjugate gradient method with Armijo search
- scientific article; zbMATH DE number 6795872
- Global convergence of an improved DY conjugate gradient method with Armijo line search
Cites work
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A globally convergent version of the Polak-Ribière conjugate gradient method
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A spectral conjugate gradient method for unconstrained optimization
- A survey of nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.
- Convergence Properties of Algorithms for Nonlinear Optimization
- Convergence properties of the Fletcher-Reeves method
- CUTE
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Function minimization by conjugate gradients
- Global convergence of conjugate gradient methods without line search
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence result for conjugate gradient methods
- scientific article; zbMATH DE number 992790 (Why is no real title available?)
- scientific article; zbMATH DE number 1004164 (Why is no real title available?)
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 1186897 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- Line search algorithms with guaranteed sufficient decrease
- Methods of conjugate gradients for solving linear systems
- On the limited memory BFGS method for large scale optimization
- Optimization. Algorithms and consistent approximations
- Scaled conjugate gradient algorithms for unconstrained optimization
- Testing Unconstrained Optimization Software
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The conjugate gradient method in extremal problems
Cited in
(only showing first 100 items - show all)- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
- A limited memory BFGS-type method for large-scale unconstrained optimization
- Two modified Dai-Yuan nonlinear conjugate gradient methods
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- 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 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
- The solution of two-phase inverse Stefan problem based on a hybrid method with optimization
- 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
- 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
- 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
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- A new descent memory gradient method and its global convergence
- A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing
- 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 class of modified FR conjugate gradient method and applications to non-negative matrix factorization
- A spectral three-term Hestenes-Stiefel conjugate gradient method
- 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
- 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
- Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
- 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
- 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
- Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- A modified Dai-Kou-type method with applications to signal reconstruction and blurred image restoration
- A new smoothing spectral conjugate gradient method for solving tensor complementarity problems
- Further comment on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems
- PRP-like algorithm for monotone operator equations
- Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets
- Convergence properties of an iterative method for solving symmetric non-linear equations
- 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
- A sufficient descent nonlinear conjugate gradient method for solving \(\mathcal{M} \)-tensor equations
- Modified three-term conjugate gradient method and its applications
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- A conjugate gradient algorithm and its applications in image restoration
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- A modified Perry conjugate gradient method and its global convergence
- A conjugate gradient type method for the nonnegative constraints optimization problems
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- Two descent hybrid conjugate gradient methods for optimization
- Nonstationary iterated Tikhonov regularization in Banach spaces with uniformly convex penalty terms
- 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
- Spectral method and its application to the conjugate gradient method
- A Riemannian Fletcher-Reeves conjugate gradient method for doubly stochastic inverse eigenvalue problems
- A sufficient descent Liu–Storey conjugate gradient method and its global convergence
- A modified projected conjugate gradient algorithm for unconstrained optimization problems
- Global convergence of a modified FR conjugate gradient method
- Global convergence of an improved DY conjugate gradient method with Armijo line search
- Global convergence of a new conjugate gradient method with Armijo search
- An improved Fletcher-Reeves conjugate gradient method with descent property
- Derivative-free three-term spectral conjugate gradient method for symmetric nonlinear equations
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
- An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
- The convergence rate of a restart MFR conjugate gradient method with inexact line search
- A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence
- Global convergence of a nonlinear conjugate gradient method
- Global convergence of a modified spectral conjugate gradient method
- 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
- Global convergence of a spectral conjugate gradient method for unconstrained optimization
- An efficient adaptive three-term extension of the Hestenes-Stiefel conjugate gradient method
- A modified Hestense-Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method
- A family of quasi-Newton methods for unconstrained optimization problems
- An extension of the Fletcher-Reeves method to linear equality constrained optimization problem
- A new conjugate gradient method for modified Fletcher-Reeves formula
- Norm descent conjugate gradient methods for solving symmetric nonlinear equations
- scientific article; zbMATH DE number 6311316 (Why is no real title available?)
- A spectral KRMI conjugate gradient method under the strong-Wolfe line search
- AN EFFICIENT METHOD FOR SOLVING A CLASS OF MATRIX TRACE FUNCTION MINIMIZATION PROBLEM IN MULTIVARIATE STATISTICAL
- An efficient hybrid conjugate gradient method for unconstrained optimization
- A globally convergent gradient-like method based on the Armijo line search
- A modified HS-DY-type method with nonmonotone line search for image restoration and unconstrained optimization problems
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Wolfe line search
- A limited memory descent Perry conjugate gradient method
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- Some new three-term Hestenes-Stiefel conjugate gradient methods with affine combination
- FR conjugate gradient methods with perturbations
- Modified nonmonotone Armijo line search for descent method
- A modified CG-DESCENT method for unconstrained optimization
This page was built for publication: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433993)
