A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions
From MaRDI portal
Publication:2103175
Recommendations
- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- A conjugate gradient method with sufficient descent and global convergence for unconstrained nonlinear optimization
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- On the global convergence of the Hager-Zhang conjugate gradient method with Armijo line search
Cites work
- A class of derivative-free methods for large-scale nonlinear monotone equations
- A class of parameter estimation methods for nonlinear Muskingum model using hybrid invasive weed optimization algorithm
- A conjugate gradient algorithm under Yuan-Wei-Lu line search technique for large-scale minimization optimization models
- A conjugate gradient method with descent direction for unconstrained optimization
- 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 method for the solution of certain non-linear problems in least squares
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A modified PRP conjugate gradient method
- A new adaptive trust region algorithm for optimization problems
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A new trust-region method with line search for solving symmetric nonlinear equations
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A novel parameter estimation method for muskingum model using new Newton-type trust region algorithm
- A spectral conjugate gradient method for unconstrained optimization
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- Algorithm 851
- An adaptive trust region algorithm for large-residual nonsmooth least squares problems
- An effective adaptive trust region algorithm for nonsmooth minimization
- BFGS trust-region method for symmetric nonlinear equations
- Convergence Properties of Algorithms for Nonlinear Optimization
- Convergence Properties of the BFGS Algoritm
- Efficient generalized conjugate gradient algorithms. I: Theory
- Function minimization by conjugate gradients
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 3503002 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- Scaled conjugate gradient algorithms for unconstrained optimization
- The conjugate gradient method in extremal problems
- The convergence properties of some new conjugate gradient methods
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- The projection technique for two open problems of unconstrained optimization problems
Cited in
(5)- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions
- Globally convergent conjugate gradient algorithms without the Lipschitz condition for nonconvex optimization
- Sparse signal reconstruction via Hager–Zhang-type schemes for constrained system of nonlinear equations
- Stochastic three-term conjugate gradient method with variance technique for non-convex learning
- An efficient low-complexity stochastic BFGS algorithm using matrix diagonal approximations for nonconvex optimization in machine learning
This page was built for publication: A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103175)
