Global Convergence Properties of Conjugate Gradient Methods for Optimization
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- 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
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- A modified PRP conjugate gradient method
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- A truncated descent HS conjugate gradient method and its global convergence
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search
- Convergence rates of a global optimization algorithm
- On the global optimization properties of finite-difference local descent algorithms
- Convergence properties of the Beale-Powell restart algorithm
- A class of nonmonotone conjugate gradient methods for unconstrained optimization
- Global convergence result for conjugate gradient methods
- Family of projected descent methods for optimization problems with simple bounds
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Ab-initio prediction and reliability of protein structural genomics by PROPAINOR algorithm
- Conjugate gradient methods with Armijo-type line searches.
- 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 family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization
- On the convergence of \(s\)-dependent GFR conjugate gradient method for unconstrained optimization
- A deterministic optimization approach for solving the rainfall disaggregation problem
- A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems
- An efficient hybrid conjugate gradient method with the strong Wolfe-Powell line search
- A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization
- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix
- Computational method for optimal control of switched systems with input and state constraints
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
- A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization
- A modified conjugacy condition and related nonlinear conjugate gradient method
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence
- A hybrid of DL and WYL nonlinear conjugate gradient methods
- A new method with sufficient descent property for unconstrained optimization
- New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- Conjugate gradient methods using value of objective function for unconstrained optimization
- A new descent algorithm with curve search rule
- The application of a unified Bayesian stopping criterion in competing parallel algorithms for global optimization
- A new family of conjugate gradient methods for unconstrained optimization
- From linear to nonlinear iterative methods
- A new variant of the memory gradient method for unconstrained optimization
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- Nonmonotone spectral method for large-scale symmetric nonlinear equations
- On the sufficient descent property of the Shanno's conjugate gradient method
- Unscented/ensemble transform-based variational filter
- The global convergence of a new mixed conjugate gradient method for unconstrained optimization
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- Further insight into the convergence of the Fletcher-Reeves method
- The Glowinski-Le Tallec splitting method revisited: a general convergence and convergence rate analysis
- Parallel two-phase methods for global optimization on GPU
- A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing
- A modified nonlinear conjugate gradient method with the Armijo line search and its application
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length
- Some nonlinear conjugate gradient methods based on spectral scaling secant equations
- A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- Improved conjugate gradient method for nonlinear system of equations
- An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem
- A new CG algorithm based on a scaled memoryless BFGS update with adaptive search strategy, and its application to large-scale unconstrained optimization problems
- Sufficient descent Riemannian conjugate gradient methods
- A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update
- The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique
- A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration
- Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
- Least-squares-based three-term conjugate gradient methods
- A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
- Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
- Two improved nonlinear conjugate gradient methods with the strong Wolfe line search
- A three-term conjugate gradient method with accelerated subspace quadratic optimization
- A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction
- A class of line search-type methods for nonsmooth convex regularized minimization
- Globally convergent diagonal Polak-Ribière-Polyak like algorithm for nonlinear equations
- The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems
- 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 modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems
- Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing
- Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property
- An online conjugate gradient algorithm for large-scale data analysis in machine learning
- A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
- A study of Liu-Storey conjugate gradient methods for vector optimization
- A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems
- New hybrid conjugate gradient method as a convex combination of LS and FR methods
- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions
- A distributed conjugate gradient online learning method over networks
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- The projection technique for two open problems of unconstrained optimization problems
- A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property
- Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints
- 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
- A derivative-free Liu-Storey method for solving large-scale nonlinear systems of equations
This page was built for publication: Global Convergence Properties of Conjugate Gradient Methods for Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018383)
