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; zbMATH DE number 179266
- 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 modified conjugate gradient method for general convex functions
- A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems
- Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems
- Application of scaled nonlinear conjugate-gradient algorithms to the inverse natural convection problem
- On a conjugate directions method for solving strictly convex QP problem
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- A sufficient descent Liu–Storey conjugate gradient method and its global convergence
- Combining and scaling descent and negative curvature directions
- A modified nonlinear conjugate gradient method with the Armijo line search and its application
- An Liu-Storey-type method for solving large-scale nonlinear monotone equations
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence
- The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
- Application of optimal control to the cardiac defibrillation problem using a physiological model of cellular dynamics
- Higher-order triangular spectral element method with optimized cubature points for seismic wavefield modeling
- A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique
- A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
- A double parameter self-scaling memoryless BFGS method for unconstrained optimization
- Convergence of the descent Dai–Yuan conjugate gradient method for unconstrained optimization
- A minimum action method for small random perturbations of two-dimensional parallel shear flows
- Instabilities in shear and simple shear deformations of gold crystals
- A new efficient conjugate gradient method for unconstrained optimization
- Numerical simulations of some nonlinear conjugate gradient methods with inexact line searches
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
- Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization
- Iterated dynamic thresholding search for packing equal circles into a circular container
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- A nonmonotone hybrid conjugate gradient method for unconstrained optimization
- A simple sufficient descent method for unconstrained optimization
- A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization
- A conjugate gradient method with sufficient descent property
- A new accelerated conjugate gradient method for large-scale unconstrained optimization
- A note on the spectral gradient projection method for nonlinear monotone equations with applications
- On the sufficient descent property of the Shanno's conjugate gradient method
- Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
- Some sufficient descent conjugate gradient methods and their global convergence
- Nonconvex optimization using negative curvature within a modified linesearch
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
- A sufficient descent conjugate gradient method and its global convergence
- LMBOPT: a limited memory method for bound-constrained optimization
- Some three-term conjugate gradient methods with the new direction structure
- A Conjugate Gradient Method Based on a Modified Secant Relation for Unconstrained Optimization
- Real-time pricing method for smart grid based on social welfare maximization model
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)
