A limited memory BFGS method for solving large-scale symmetric nonlinear equations

DOI10.1155/2014/716019zbMath1474.65144OpenAlexW2034178318WikidataQ59040854 ScholiaQ59040854MaRDI QIDQ1724803

Xiaoliang Wang, Xiabin Duan, Xiangrong Li

Publication date: 14 February 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/716019

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10)

Related Items (3)

Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems ⋮ A class of spectral three-term descent Hestenes-Stiefel conjugate gradient algorithms for large-scale unconstrained optimization and image restoration problems ⋮ A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems

Uses Software

• tn
• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• A BFGS trust-region method for nonlinear equations
• Limited memory BFGS method with backtracking for symmetric nonlinear equations
• BFGS trust-region method for symmetric nonlinear equations
• A new backtracking inexact BFGS method for symmetric nonlinear equations
• Successive column correction algorithms for solving sparse nonlinear systems of equations
• On the closed form solution of Troesch's problem
• Representations of quasi-Newton matrices and their use in limited memory methods
• A survey of truncated-Newton methods
• Nonmonotone backtracking inexact quasi-Newton algorithms for solving smooth nonlinear equations
• A New Method with Descent Property for Symmetric Nonlinear Equations
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• 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
• Testing Unconstrained Optimization Software
• Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
• An Efficient Implementation of Merrill’s Method for Sparse or Partially Separable Systems of Nonlinear Equations
• Convergence Theory of Nonlinear Newton–Krylov Algorithms
• A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
• Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations
• A BFGS algorithm for solving symmetric nonlinear equations

This page was built for publication: A limited memory BFGS method for solving large-scale symmetric nonlinear equations