A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
From MaRDI portal
Publication:5317554
DOI10.1137/030601880zbMATH Open1093.90085OpenAlexW2018215034MaRDI QIDQ5317554FDOQ5317554
Authors: William Hager, Hongchao Zhang 
Publication date: 16 September 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/45efe38ea906de376db50a86b8a11ef566821e42
Recommendations
- A new type of descent conjugate gradient method with exact line search
- scientific article; zbMATH DE number 1092181
- A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties
- scientific article; zbMATH DE number 1022806
- A new nonlinear conjugate gradient method with guaranteed global convergence
- scientific article
- A new conjugate gradient method with the Wolfe line search
- A new conjugate gradient method for unconstrained optimization with sufficient descent
- An efficient conjugate gradient method with sufficient descent property
- A new conjugate gradient method with strongly global convergence and sufficient descent condition
convergencenonlinear programmingglobal convergenceunconstrained optimizationconjugate gradient methodline searchWolfe conditionsCUTE
Cited In (only showing first 100 items - show all)
- A modified conjugate gradient method based on the self-scaling memoryless BFGS update
- Solving optimal control problem of monodomain model using hybrid conjugate gradient methods
- A note on robust descent in differentiable optimization
- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search
- Conditional gradient method for vector optimization
- Sufficient descent Riemannian conjugate gradient methods
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction
- New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- A family of quasi-Newton methods for unconstrained optimization problems
- An efficient conjugate gradient trust-region approach for systems of nonlinear equation
- An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization
- A new derivative-free SCG-type projection method for nonlinear monotone equations with convex constraints
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- A Fokker-Planck approach to control collective motion
- Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization
- Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization
- A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
- Flow search approach and new bounds for the \(m\)-step linear conjugate gradient algorithm
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization
- Speeding up the convergence of the Polyak's heavy ball algorithm
- On the efficiency of gradient based optimization algorithms for DNS-based optimal control in a turbulent channel flow
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
- Derivative-free method for bound constrained nonlinear monotone equations and its application in solving steady state reaction-diffusion problems
- An improved Perry conjugate gradient method with adaptive parameter choice
- A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems
- Preconditioned nonlinear conjugate gradient methods based on a modified secant equation
- A derivative-free iterative method for nonlinear monotone equations with convex constraints
- Second-order approximation and fast multigrid solution of parabolic bilinear optimization problems
- A class of one parameter conjugate gradient methods
- A truncated descent HS conjugate gradient method and its global convergence
- Riemannian Multigrid Line Search for Low-Rank Problems
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
- A note on the global convergence theorem of accelerated adaptive Perry conjugate gradient methods
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix
- An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization
- A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update
- Two nonmonotone trust region algorithms based on an improved Newton method
- A hybrid of DL and WYL nonlinear conjugate gradient methods
- A Barzilai-Borwein gradient projection method for sparse signal and blurred image restoration
- A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization
- Further comment on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei
- On the optimal control of a random walk with jumps and barriers
- Title not available (Why is that?)
- An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints
- A joint optimization of momentum item and Levenberg-Marquardt algorithm to level up the BPNN's generalization ability
- Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization
- Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination
- A Fokker–Planck Feedback Control-Constrained Approach for Modelling Crowd Motion
- A derivative-free conjugate gradient method and its global convergence for solving symmetric nonlinear equations
- A Regularization Approach for an Inverse Source Problem in Elliptic Systems from Single Cauchy Data
- \(n\)-step quadratic convergence of the MPRP method with a restart strategy
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems
- A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
- Title not available (Why is that?)
- Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search
- The Variational Gaussian Approximation Revisited
- 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
- A trust region algorithm with conjugate gradient technique for optimization problems
- Two modified DY conjugate gradient methods for unconstrained optimization problems
- Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
- A descent family of Dai–Liao conjugate gradient methods
- Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
- A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties
- A modified conjugate gradient method based on a modified secant equation
- Two adaptive Dai-Liao nonlinear conjugate gradient methods
- An adaptive high-order minimum action method
- Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
- Two modified Dai-Yuan nonlinear conjugate gradient methods
- A NEW NONLINEAR CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION
- Two modified Polak-Ribière-Polyak-type nonlinear conjugate methods with sufficient descent property
- An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix
- A modified Perry conjugate gradient method and its global convergence
- On efficiently combining limited-memory and trust-region techniques
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- A projection method for convex constrained monotone nonlinear equations with applications
- A new family of conjugate gradient methods
- An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation
- Two optimal Dai–Liao conjugate gradient methods
- Sufficient descent conjugate gradient methods for large-scale optimization problems
- Improving directions of negative curvature in an efficient manner
- Design of optimal PID controller with \(\epsilon\)-Routh stability for different processes
- An improved nonlinear conjugate gradient method with an optimal property
- A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach
- On the sufficient descent condition of the Hager-Zhang conjugate gradient methods
- Self-adaptive inexact proximal point methods
- An adaptive conjugate gradient algorithm for large-scale unconstrained optimization
- Norm descent conjugate gradient methods for solving symmetric nonlinear equations
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization
- A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization
- A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations
Uses Software
This page was built for publication: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317554)
