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 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 conjugate gradient method based on a modified secant relation for unconstrained optimization
- 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
- 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
- Variational formulation for Wannier functions with entangled band structure
- 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
- Convergence of the descent Dai-Yuan conjugate gradient method for unconstrained optimization
- Real-time pricing method for smart grid based on social welfare maximization model
- The new spectral conjugate gradient method for large-scale unconstrained optimisation
- A smoothing iterative method for the finite minimax problem
- A sufficient descent LS conjugate gradient method for unconstrained optimization problems
- New three-term conjugate gradient method with guaranteed global convergence
- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
- An active set trust-region method for bound-constrained optimization
- A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations
- A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches
- Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems
- A new conjugate gradient algorithm for training neural networks based on a modified secant equation
- CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method
- A dynamic-solver-consistent minimum action method: with an application to 2D Navier-Stokes equations
- A modified spectral conjugate gradient method with global convergence
- 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
- 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
- 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
- Two optimal Dai-Liao 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 hybridization of the Hestenes-Stiefel and Dai-Yuan conjugate gradient methods based on a least-squares approach
- 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 descent family of Dai-Liao conjugate gradient methods
- A new family of conjugate gradient methods
- Modified Dai-Yuan conjugate gradient method with sufficient descent property for nonlinear equations
- An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation
- 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
- 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
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)
