Sufficient descent nonlinear conjugate gradient methods with conjugacy condition
From MaRDI portal
Publication:849150
DOI10.1007/S11075-009-9318-8zbMATH Open1185.65097OpenAlexW2081790497MaRDI QIDQ849150FDOQ849150
Authors: Wanyou Cheng, Qunfeng Liu 
Publication date: 24 February 2010
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-009-9318-8
Recommendations
- scientific article; zbMATH DE number 7366152
- Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence
- scientific article; zbMATH DE number 7109378
- Nonlinear conjugate gradient methods with sufficient descent properties for unconstrained optimization
- scientific article; zbMATH DE number 5845974
- A sufficient descent conjugate gradient method and its global convergence
- A conjugate gradient method with sufficient descent property
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
- Some sufficient descent conjugate gradient methods and their global convergence
Cites Work
- CUTE
- Benchmarking optimization software with performance profiles.
- On the limited memory BFGS method for large scale optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
- A survey of nonlinear conjugate gradient methods
- A spectral conjugate gradient method for unconstrained optimization
- Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
- New quasi-Newton equation and related methods for unconstrained optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
Cited In (24)
- Title not available (Why is that?)
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction
- A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence
- Some nonlinear conjugate gradient methods based on spectral scaling secant equations
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- Globally convergent modified Perry's conjugate gradient method
- A memory gradient method based on the nonmonotone technique
- Title not available (Why is that?)
- A modified Perry conjugate gradient method and its global convergence
- Matrix structures in queuing models
- AN ADAPTIVE CONJUGACY CONDITION AND RELATED NONLINEAR CONJUGATE GRADIENT METHODS
- A conjugate gradient method with sufficient descent property
- Some sufficient descent conjugate gradient methods and their global convergence
- Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations
- Title not available (Why is that?)
- Conservative descent for semi-orthogonal decompositions
- Norm descent conjugate gradient methods for solving symmetric nonlinear equations
- Exponential convergence of Sobolev gradient descent for a class of nonlinear eigenproblems
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
- FR type methods for systems of large-scale nonlinear monotone equations
- A new class of nonmonotone conjugate gradient training algorithms
- A limited memory descent Perry conjugate gradient method
- A nonmonotone supermemory gradient algorithm for unconstrained optimization
Uses Software
This page was built for publication: Sufficient descent nonlinear conjugate gradient methods with conjugacy condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q849150)
