A derivative-free Liu-Storey method for solving large-scale nonlinear systems of equations
From MaRDI portal
Publication:2214799
DOI10.1155/2020/6854501zbMath1459.65066OpenAlexW3096173524MaRDI QIDQ2214799
Publication date: 10 December 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/6854501
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- On optimality of two adaptive choices for the parameter of Dai-Liao method
- A sufficient descent LS conjugate gradient method for unconstrained optimization problems
- Efficient generalized conjugate gradient algorithms. I: Theory
- A globally convergent derivative-free method for solving large-scale nonlinear monotone equations
- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
- Globally convergent inexact quasi-Newton methods for solving nonlinear systems
- An improved three-term derivative-free method for solving nonlinear equations
- Superlinear convergence of a Newton-type algorithm for monotone equations
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- A descent Dai-Liao conjugate gradient method for nonlinear equations
- A Globally Convergent Newton-GMRES Subspace Method for Systems of Nonlinear Equations
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Two optimal Dai–Liao conjugate gradient methods
- A Family of Quasi-Newton Methods for Nonlinear Equations with Direct Secant Updates of Matrix Factorizations
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Convergence Theory of Nonlinear Newton–Krylov Algorithms
- CUTE
- A nonmonotone hybrid method for nonlinear systems∗
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- A Nonmonotone Line Search Technique for Newton’s Method
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A derivative-free nonmonotone line search and its application to the spectral residual method
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- The conjugate gradient method in extremal problems
- A derivative-free PRP method for solving large-scale nonlinear systems of equations and its global convergence
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
This page was built for publication: A derivative-free Liu-Storey method for solving large-scale nonlinear systems of equations