A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
From MaRDI portal
Publication:5317554
DOI10.1137/030601880zbMATH Open1093.90085OpenAlexW2018215034MaRDI QIDQ5317554FDOQ5317554
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
- Conjugate gradient methods using value of objective function for unconstrained optimization
- 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 scaled nonlinear conjugate gradient algorithm for unconstrained optimization
- Quantum optimal control using the adjoint method
- A robust extremum seeking scheme for dynamic systems with uncertainties and disturbances
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search
- Modeling and control through leadership of a refined flocking system
- Spectral method and its application to the conjugate gradient method
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- Riemannian Conjugate Gradient Methods: General Framework and Specific Algorithms with Convergence Analyses
- A conjugate gradient method with descent direction for unconstrained optimization
- On Hager and Zhang's conjugate gradient method with guaranteed descent
- The convergence of conjugate gradient method with nonmonotone line search
- A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
- Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- Some modified conjugate gradient methods for unconstrained optimization
- New hybrid conjugate gradient method for unconstrained optimization
- Globally convergent modified Perry's conjugate gradient method
- Algorithm 851
- Applying powell's symmetrical technique to conjugate gradient methods
- An optimal parameter for Dai-Liao family of conjugate gradient methods
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- Global convergence of some modified PRP nonlinear conjugate gradient methods
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- Two descent hybrid conjugate gradient methods for optimization
- A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints
- Scaled conjugate gradient algorithms for unconstrained optimization
- Two modified scaled nonlinear conjugate gradient methods
- A limited memory BFGS-type method for large-scale unconstrained optimization
- A conjugate gradient method for unconstrained optimization problems
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
- Hybrid conjugate gradient algorithm for unconstrained optimization
- A spectral dai-yuan-type conjugate gradient method for unconstrained optimization
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- An efficient multigrid strategy for large-scale molecular mechanics optimization
- A second-order gradient method for convex minimization
- A globally and R-linearly convergent hybrid HS and PRP method and its inexact version with applications
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems
- A practical PR+ conjugate gradient method only using gradient
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)
