A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
From MaRDI portal
Publication:2515066
DOI10.1007/s10589-014-9662-zzbMath1315.90051OpenAlexW2067693696MaRDI QIDQ2515066
Yasushi Narushima, Mehiddin Al-Baali, Hiroshi Yabe
Publication date: 10 February 2015
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-014-9662-z
unconstrained optimizationglobal convergencethree-term conjugate gradient methodsufficient descent condition
Related Items
A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations, An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition, A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints, A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems, On the convergence of \(s\)-dependent GFR conjugate gradient method for unconstrained optimization, Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search, A new smoothing spectral conjugate gradient method for solving tensor complementarity problems, A distributed conjugate gradient online learning method over networks, Further comment on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei, New three-term conjugate gradient algorithm for solving monotone nonlinear equations and signal recovery problems, A family of three-term conjugate gradient projection methods with a restart procedure and their relaxed-inertial extensions for the constrained nonlinear pseudo-monotone equations with applications, A new modified three-term conjugate gradient method with sufficient descent property and its global convergence, A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem, A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems, A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems, Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization, Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods, A Five-Parameter Class of Derivative-Free Spectral Conjugate Gradient Methods for Systems of Large-Scale Nonlinear Monotone Equations, Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration, Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery, Unnamed Item, A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence, An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method, An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem, Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization, Modified Hager–Zhang conjugate gradient methods via singular value analysis for solving monotone nonlinear equations with convex constraint, A conjugate gradient projection method for solving equations with convex constraints, A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration, Least-squares-based three-term conjugate gradient methods, Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems, A one-parameter class of three-term conjugate gradient methods with an adaptive parameter choice
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- Efficient generalized conjugate gradient algorithms. I: Theory
- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
- Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Comparison of some conjugate direction procedures for function minimization
- 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
- Algorithm 851
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Two-Point Step Size Gradient Methods
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- CUTE
- 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
- Function minimization by conjugate gradients
- The Limited Memory Conjugate Gradient Method
- Some descent three-term conjugate gradient methods and their global convergence
- A Two-Term PRP-Based Descent Method
- CUTEr and SifDec
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.
