The convergence of conjugate gradient method with nonmonotone line search
From MaRDI portal
Publication:606706
DOI10.1016/J.AMC.2010.06.047zbMATH Open1206.65166OpenAlexW2014919593MaRDI QIDQ606706FDOQ606706
Authors: Zhiwei Xu, Zhenjun Shi, Sheng-Quan Wang 
Publication date: 18 November 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.06.047
Recommendations
- Convergence of Liu-Storey conjugate gradient method
- Convergence of Liu-Storey conjugate method with nonmonotone Armijo line search
- A new family of conjugate gradient methods
- Global convergence of conjugate gradient method
- A new class of conjugate gradient methods with extended nonmonotone line search
Cites Work
- Algorithm 851
- Testing Unconstrained Optimization Software
- CUTE
- Numerical Optimization
- Title not available (Why is that?)
- Function minimization by conjugate gradients
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- On the Convergence of a New Conjugate Gradient Algorithm
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Efficient generalized conjugate gradient algorithms. I: Theory
- Global convergence result for conjugate gradient methods
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Title not available (Why is that?)
- Minimization of functions having Lipschitz continuous first partial derivatives
- Analysis of monotone gradient methods
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- A survey of nonlinear conjugate gradient methods
- A new stepsize for the steepest descent method
- A globally convergent version of the Polak-Ribière conjugate gradient method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- On the nonmonotone line search
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- Convergence of nonmonotone line search method
- Global convergence of conjugate gradient methods without line search
- Convergence of descent method without line search
- Global convergence of a two-parameter family of conjugate gradient methods without line search
- Quadratic cost flow and the conjugate gradient method
- Title not available (Why is that?)
- Convergence of the Polak-Ribiére-Polyak conjugate gradient method
Cited In (21)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence of PRP method with new nonmonotone line search
- Nonconforming double set parameter finite element methods for a fourth order variational inequality with two-sided displacement obstacle
- A hybrid conjugate finite-step length method for robust and efficient reliability analysis
- Global convergence of conjugate gradient method
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence
- Globally convergent modified Perry's conjugate gradient method
- On the convergence of conjugate gradient algorithms
- A memory gradient method based on the nonmonotone technique
- Convergence of nonmonotone line search method
- New convergence method with nonmonotone line search
- Convergence of Liu-Storey conjugate method with nonmonotone Armijo line search
- Global convergence of line search (LS) conjugate gradient algorithm with nonmonotone technique
- Convergence of Liu-Storey conjugate gradient method
- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
- A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches
- A new class of nonmonotone conjugate gradient training algorithms
- A new class of nonlinear conjugate gradient coefficients with global convergence properties
- A nonmonotone supermemory gradient algorithm for unconstrained optimization
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
Uses Software
This page was built for publication: The convergence of conjugate gradient method with nonmonotone line search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606706)
