A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
From MaRDI portal
Publication:3004981
DOI10.1137/080743573zbMath1250.90087OpenAlexW2137900593MaRDI QIDQ3004981
Yasushi Narushima, Hiroshi Yabe, John A. Ford
Publication date: 6 June 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://repository.essex.ac.uk/1745/1/2486.pdf
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items (66)
Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination ⋮ A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations ⋮ Comment on ``A new three-term conjugate gradient method for unconstrained problem ⋮ Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization ⋮ 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 ⋮ A memory gradient method based on the nonmonotone technique ⋮ An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization ⋮ A modified conjugate gradient method based on a modified secant equation ⋮ New conjugate gradient-like methods for unconstrained optimization ⋮ A new family of hybrid three-term conjugate gradient methods with applications in image restoration ⋮ 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 four-term extension of the Dai-Liao conjugate gradient method ⋮ A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems ⋮ 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 ⋮ A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property ⋮ Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition ⋮ Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization ⋮ Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization ⋮ A hybrid Riemannian conjugate gradient method for nonconvex optimization problems ⋮ A class of three-term derivative-free methods for large-scale nonlinear monotone system of equations and applications to image restoration problems ⋮ Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery ⋮ Unnamed Item ⋮ An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization ⋮ A modified Hestenes–Stiefel conjugate gradient method with an optimal property ⋮ A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence ⋮ A Modified Nonmonotone Hestenes–Stiefel Type Conjugate Gradient Methods for Large-Scale Unconstrained Problems ⋮ A smoothing conjugate gradient method for solving systems of nonsmooth equations ⋮ An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method ⋮ PRP-like algorithm for monotone operator equations ⋮ A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems ⋮ New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction ⋮ On the solution of the eigenvalue assignment problem for discrete-time systems ⋮ Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence ⋮ An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ A practical PR+ conjugate gradient method only using gradient ⋮ 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 scaled three-term conjugate gradient method for large-scale unconstrained optimization problem ⋮ On the convergence properties of the unmodified PRP method with a non-descent line search ⋮ A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization ⋮ Some three-term conjugate gradient methods with the inexact line search condition ⋮ On three-term conjugate gradient algorithms for unconstrained optimization ⋮ A new three-term conjugate gradient algorithm for unconstrained optimization ⋮ 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 modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ A spectral three-term Hestenes-Stiefel conjugate gradient method ⋮ Optimization for Inconsistent Split Feasibility Problems ⋮ A nonmonotone supermemory gradient algorithm for unconstrained optimization ⋮ Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization ⋮ Some three-term conjugate gradient methods with the new direction structure ⋮ Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations ⋮ Descent three-term DY-type conjugate gradient methods for constrained monotone equations with application ⋮ A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration ⋮ The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems ⋮ A three-term conjugate gradient method with accelerated subspace quadratic optimization ⋮ A NEW THREE–TERM CONJUGATE GRADIENT METHOD WITH DESCENT DIRECTION FOR UNCONSTRAINED OPTIMIZATION ⋮ 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
Uses Software
This page was built for publication: A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
