A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems
From MaRDI portal
Publication:2332754
DOI10.1016/j.cam.2019.112454zbMath1423.90250OpenAlexW2971774403MaRDI QIDQ2332754
Publication date: 5 November 2019
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2019.112454
Related Items (11)
Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization ⋮ An efficient modified residual-based algorithm for large scale symmetric nonlinear equations by approximating successive iterated gradients ⋮ A fast inertial self-adaptive projection based algorithm for solving large-scale nonlinear monotone equations ⋮ The projection technique for two open problems of unconstrained optimization problems ⋮ A three-term projection method based on spectral secant equation for nonlinear monotone equations ⋮ Global dynamics of a controlled discontinuous diffusive SIR epidemic system ⋮ Convergence analysis of an improved BFGS method and its application in the Muskingum model ⋮ Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization ⋮ A globally convergent BFGS method for symmetric nonlinear equations ⋮ Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing ⋮ A class of line search-type methods for nonsmooth convex regularized minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Norm descent conjugate gradient methods for solving symmetric nonlinear equations
- Recent advances in numerical methods for nonlinear equations and nonlinear least squares
- A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
- A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations
- A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
- The BFGS method with exact line searches fails for non-convex objective functions
- A PRP-based residual method for large-scale monotone nonlinear equations
- On the convergence of the modified Levenberg-Marquardt method with a nonmonotone second order Armijo type line search
- Convergence properties of an iterative method for solving symmetric non-linear equations
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- The global convergence of a modified BFGS method for nonconvex functions
- A modified quasi-Newton method for nonlinear equations
- Optimization theory and methods. Nonlinear programming
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- Global Convergence of a New Hybrid Gauss–Newton Structured BFGS Method for Nonlinear Least Squares Problems
- The modified Levenberg-Marquardt method for nonlinear equations with cubic convergence
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations
- Convergence Properties of the BFGS Algoritm
- An Inexact PRP Conjugate Gradient Method for Symmetric Nonlinear Equations
- A modified BFGS method and its global convergence in nonconvex minimization
This page was built for publication: A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems
