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

DOI10.1155/2014/716019MaRDI QIDQ1724803zbMATH OpenOpenAlexWikidataFDO

Authors Xiangrong Li, Xiaoliang Wang, Xiabin Duan

Publication date 14 February 2019

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

Copyright license Creative Commons Attribution 3.0 Unported

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

Mathematics Subject Classification ID

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

Review text

Summary: A limited memory BFGS (L-BFGS) algorithm is presented for solving large-scale symmetric nonlinear equations, where a line search technique without derivative information is used. The global convergence of the proposed algorithm is established under some suitable conditions. Numerical results show that the given method is competitive to those of the normal BFGS methods.

Recommendations

• Limited memory BFGS method with backtracking for symmetric nonlinear equations
• Limited memory technique using trust regions for nonlinear equations
• A BFGS algorithm for solving symmetric nonlinear equations
• BFGS trust-region method for symmetric nonlinear equations
• A trust-region-based BFGS method with line search technique for symmetric nonlinear equations

Cites work

• A BFGS algorithm for solving symmetric nonlinear equations
• A BFGS trust-region method for nonlinear equations
• A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
• A new backtracking inexact BFGS method for symmetric nonlinear equations
• A New Method with Descent Property for Symmetric Nonlinear Equations
• A rank-one fitting method for solving symmetric nonlinear equations
• A survey of truncated-Newton methods
• A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
• An Efficient Implementation of Merrill’s Method for Sparse or Partially Separable Systems of Nonlinear Equations
• BFGS trust-region method for symmetric nonlinear equations
• Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
• Convergence Theory of Nonlinear Newton–Krylov Algorithms
• Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• Limited memory BFGS method with backtracking for symmetric nonlinear equations
• Nonmonotone backtracking inexact quasi-Newton algorithms for solving smooth nonlinear equations
• On the closed form solution of Troesch's problem
• Representations of quasi-Newton matrices and their use in limited memory methods
• Successive column correction algorithms for solving sparse nonlinear systems of equations
• Testing Unconstrained Optimization Software
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• The “global” convergence of Broyden-like methods with suitable line search

Cited in

(6)

• A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
• Limited memory technique using trust regions for nonlinear equations
• Limited memory BFGS method for least squares semidefinite programming with banded structure
• A class of spectral three-term descent Hestenes-Stiefel conjugate gradient algorithms for large-scale unconstrained optimization and image restoration problems
• Limited memory BFGS method with backtracking for symmetric nonlinear equations
• Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems

Describes a project that uses

Uses Software

• tn
• minpack

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1724803)