Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
From MaRDI portal
Recommendations
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
- scientific article; zbMATH DE number 7109378
- A conjugate gradient method with sufficient descent and global convergence for unconstrained nonlinear optimization
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization
Cites work
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A conjugate direction algorithm without line searches
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A globally convergent version of the Polak-Ribière conjugate gradient method
- A limited memory BFGS-type method for large-scale unconstrained optimization
- A spectral conjugate gradient method for unconstrained optimization
- A survey of nonlinear conjugate gradient methods
- Another nonlinear conjugate gradient algorithm for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- CUTE
- Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method
- Convergence properties of the Fletcher-Reeves method
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Global convergence of conjugate gradient methods without line search
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
- Methods of conjugate gradients for solving linear systems
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New quasi-Newton equation and related methods for unconstrained optimization
- New quasi-Newton methods for unconstrained optimization problems
- Optimization theory and methods. Nonlinear programming
- Scaled conjugate gradient algorithms for unconstrained optimization
- The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions
- The superlinear convergence of a modified BFGS-type method for unconstrained optimization
Cited in
(33)- A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence
- Sufficient descent conjugate gradient methods for large-scale optimization problems
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- Global convergence of a nonlinear conjugate gradient method
- A simple sufficient descent method for unconstrained optimization
- A survey of sufficient descent conjugate gradient methods for unconstrained optimization
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
- Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization
- Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations
- A conjugate gradient method with sufficient descent and global convergence for unconstrained nonlinear optimization
- Nonlinear conjugate gradient methods with sufficient descent properties for unconstrained optimization
- A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations
- Descent symmetrization of the Dai-Liao conjugate gradient method
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
- Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
- DTSMA: dominant swarm with adaptive T-distribution mutation-based slime mould algorithm
- Some three-term conjugate gradient methods with the new direction structure
- A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
- A new modified three-term conjugate gradient method with sufficient descent property and its global convergence
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- Spectral three-term constrained conjugate gradient algorithm for function minimizations
- On the sufficient descent condition of the Hager-Zhang conjugate gradient methods
- scientific article; zbMATH DE number 7109378 (Why is no real title available?)
- Sufficient descent nonlinear conjugate gradient methods with conjugacy condition
- A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization
- scientific article; zbMATH DE number 7366152 (Why is no real title available?)
- Global convergence of some modified PRP nonlinear conjugate gradient methods
- A new three-term conjugate gradient algorithm for unconstrained optimization
- On three-term conjugate gradient algorithms for unconstrained optimization
This page was built for publication: Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1036299)
