Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization
From MaRDI portal
(Redirected from Publication:2299208)
Recommendations
- A descent family of three-term conjugate gradient methods with global convergence for general functions
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- Some descent three-term conjugate gradient methods and their global convergence
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- Two modified three-term conjugate gradient methods with sufficient descent property
Cites work
- scientific article; zbMATH DE number 3439906 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (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 family of Dai-Liao conjugate gradient methods
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
- A modified three-term PRP conjugate gradient algorithm for optimization models
- A new three-term conjugate gradient method
- A scaled conjugate gradient method for nonlinear unconstrained optimization
- A scaled three-term conjugate gradient method for unconstrained optimization
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- A spectral conjugate gradient method for unconstrained optimization
- A subspace conjugate gradient algorithm for large-scale unconstrained optimization
- A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix
- An efficient modified Polak-Ribière-Polyak conjugate gradient method with global convergence properties
- An inexact Newton method for solving complementarity problems in hydrodynamic lubrication
- An optimal parameter for Dai-Liao family of conjugate gradient methods
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New three-term conjugate gradient method with guaranteed global convergence
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
- On optimality of two adaptive choices for the parameter of Dai-Liao method
- On three-term conjugate gradient algorithms for unconstrained optimization
- Optimization theory and methods. Nonlinear programming
- Restart procedures for the conjugate gradient method
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization
- Some descent three-term conjugate gradient methods and their global convergence
- The conjugate gradient method in extremal problems
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
Cited in
(16)- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- A Five-Parameter Class of Derivative-Free Spectral Conjugate Gradient Methods for Systems of Large-Scale Nonlinear Monotone Equations
- Some improved Dai-Yuan conjugate gradient methods for large-scale unconstrained optimization problems
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- An efficient projection algorithm for large-scale system of monotone nonlinear equations with applications in signal recovery
- A new smoothing spectral conjugate gradient method for solving tensor complementarity problems
- A family of the modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent and conjugacy conditions
- An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method
- A three-term projection method based on spectral secant equation for nonlinear monotone equations
- Scaled three-term derivative-free methods for solving large-scale nonlinear monotone equations
- A modified scaled spectral-conjugate gradient-based algorithm for solving monotone operator equations
- A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem
- Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization
- Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems
- A descent family of three-term conjugate gradient methods with global convergence for general functions
- A spectral gradient-type derivative-free projection algorithm for solving nonlinear convex constrained equations with its application
This page was built for publication: Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299208)
