A BFGS algorithm for solving symmetric nonlinear equations
From MaRDI portal
Publication:4916309
DOI10.1080/02331934.2011.564621zbMath1262.90141OpenAlexW2028325718MaRDI QIDQ4916309
Publication date: 22 April 2013
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.564621
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical computation of solutions to systems of equations (65H10)
Related Items (15)
The Hager–Zhang conjugate gradient algorithm for large-scale nonlinear equations ⋮ Modified Newton method based iterative learning control design for discrete nonlinear systems with constraints ⋮ A modified nonmonotone BFGS algorithm for unconstrained optimization ⋮ Two-dimensional distribution of streamwise velocity in open channel flow using maximum entropy principle: incorporation of additional constraints based on conservation laws ⋮ An efficient modified residual-based algorithm for large scale symmetric nonlinear equations by approximating successive iterated gradients ⋮ A class of three-term derivative-free methods for large-scale nonlinear monotone system of equations and applications to image restoration problems ⋮ A limited memory BFGS method for solving large-scale symmetric nonlinear equations ⋮ A modified conjugate gradient algorithm with backtracking line search technique for large-scale nonlinear equations ⋮ A quasi-Newton algorithm for large-scale nonlinear equations ⋮ A modified three-term PRP conjugate gradient algorithm for optimization models ⋮ Unnamed Item ⋮ A derivative-free \textit{RMIL} conjugate gradient projection method for convex constrained nonlinear monotone equations with applications in compressive sensing ⋮ A tensor trust-region model for nonlinear system ⋮ A globally convergent BFGS method for symmetric nonlinear equations ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
Cites Work
- Unnamed Item
- A trust-region-based BFGS method with line search technique for symmetric nonlinear equations
- Convergence analysis of a modified BFGS method on convex minimizations
- A conjugate gradient method with descent direction for unconstrained optimization
- The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions
- 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
- Testing parallel variable transformation
- A new trust region method for nonlinear equations
- Nonmonotone backtracking inexact quasi-Newton algorithms for solving smooth nonlinear equations
- New line search methods for unconstrained optimization
- A New Method with Descent Property for Symmetric Nonlinear Equations
- MODIFIED LIMITED MEMORY BFGS METHOD WITH NONMONOTONE LINE SEARCH FOR UNCONSTRAINED OPTIMIZATION
- The “global” convergence of Broyden-like methods with suitable line search
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Quasi-Newton Methods, Motivation and Theory
- Convergence Theory of Nonlinear Newton–Krylov Algorithms
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- Convergence Properties of the BFGS Algoritm
- Numerical Schubert Calculus by the Pieri Homotopy Algorithm
- Benchmarking optimization software with performance profiles.
This page was built for publication: A BFGS algorithm for solving symmetric nonlinear equations