The Hager–Zhang conjugate gradient algorithm for large-scale nonlinear equations
From MaRDI portal
Publication:5031714
DOI10.1080/00207160.2018.1494825zbMath1499.90233OpenAlexW2811285998WikidataQ129589600 ScholiaQ129589600MaRDI QIDQ5031714
Bopeng Wang, Zhou Sheng, Gong Lin Yuan
Publication date: 16 February 2022
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2018.1494825
Related Items (9)
A globally convergent projection method for a system of nonlinear monotone equations ⋮ A modified Hager-Zhang conjugate gradient method with optimal choices for solving monotone nonlinear equations ⋮ A family of three-term conjugate gradient projection methods with a restart procedure and their relaxed-inertial extensions for the constrained nonlinear pseudo-monotone equations with applications ⋮ A globally convergent derivative-free projection method for nonlinear monotone equations with applications ⋮ Modified Hager–Zhang conjugate gradient methods via singular value analysis for solving monotone nonlinear equations with convex constraint ⋮ Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations ⋮ Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations ⋮ A family of inertial-relaxed DFPM-based algorithms for solving large-scale monotone nonlinear equations with application to sparse signal restoration ⋮ Globally convergent diagonal Polak-Ribière-Polyak like algorithm for nonlinear equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified Fletcher-Reeves-type derivative-free method for symmetric nonlinear equations
- Practical quasi-Newton algorithms for singular nonlinear systems
- \(n\)-step quadratic convergence of the MPRP method with a restart strategy
- A BFGS trust-region method for nonlinear equations
- Limited memory BFGS method with backtracking for symmetric nonlinear equations
- A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- A conjugate gradient method with descent direction for unconstrained optimization
- Subspace methods for large scale nonlinear equations and nonlinear least squares
- A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems
- The convergence properties of some new conjugate gradient methods
- A PRP type method for systems of monotone equations
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- BFGS trust-region method for symmetric nonlinear equations
- A modified PRP conjugate gradient method
- A new backtracking inexact BFGS method for symmetric nonlinear equations
- Efficient hybrid conjugate gradient techniques
- On the rate of superlinear convergence of a class of variable metric methods
- Tensor methods for large sparse systems of nonlinear equations
- Global convergence result for conjugate gradient methods
- A new trust region method for nonlinear equations
- On the convergence of a trust-region method for solving constrained nonlinear equations with degenerate solutions
- Convergence of line search methods for unconstrained optimization
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- Nonmonotone derivative-free methods for nonlinear equations
- A projection method for a system of nonlinear monotone equations with convex constraints
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- Spectral gradient projection method for solving nonlinear monotone equations
- A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- A class of derivative-free methods for large-scale nonlinear monotone equations
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Die Konvergenzordnung des Fletcher-Powell-Algorithmus
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
- Algorithm 851
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- CUTE
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- Numerical Solution of Large Sets of Algebraic Nonlinear Equations
- Rate of Convergence of Several Conjugate Gradient Algorithms
- Numerical Schubert Calculus by the Pieri Homotopy Algorithm
- A BFGS algorithm for solving symmetric nonlinear equations
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.
This page was built for publication: The Hager–Zhang conjugate gradient algorithm for large-scale nonlinear equations
