A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem
From MaRDI portal
Recommendations
- A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems
- A scaled three-term conjugate gradient method for unconstrained optimization
- A three-term conjugate gradient algorithm using subspace for large-scale unconstrained optimization
- A scaled conjugate gradient method for nonlinear unconstrained optimization
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
Cites work
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A globally convergent method of moving asymptotes with trust region technique
- A globally convergent version of the Polak-Ribière conjugate gradient method
- A modified Hestenes-Stiefel conjugate gradient method with an optimal property
- A modified spectral conjugate gradient method with global convergence
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A new method of moving asymptotes for large-scale unconstrained optimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- CUTE
- Function minimization by conjugate gradients
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Global convergence of a nonlinear programming method using convex approximations
- Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- Numerical Optimization
- On the Convergence of a New Conjugate Gradient Algorithm
- Some descent three-term conjugate gradient methods and their global convergence
- The conjugate gradient method in extremal problems
- The method of moving asymptotes—a new method for structural optimization
Cited in
(8)- Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration
- A new method of moving asymptotes for large-scale unconstrained optimization
- A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems
- A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations
- Two classes of spectral three-term derivative-free method for solving nonlinear equations with application
- A new structured spectral conjugate gradient method for nonlinear least squares problems
- A self-adaptive restarting hybrid three-term conjugate gradient method and its applications
This page was built for publication: A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009756)
