A new backtracking inexact BFGS method for symmetric nonlinear equations

DOI10.1016/j.camwa.2006.12.081zbMath1176.65063MaRDI QIDQ1031701

Gong Lin Yuan, Xi-wen Lu

Publication date: 30 October 2009

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.12.081

zbMATH Keywords

global convergence; numerical results; superlinear convergence; line search; symmetric nonlinear equations; Broyden-Fletcher-Goldfarb-Shanno (BFGS) method

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

65H10: Numerical computation of solutions to systems of equations

Related Items

A BFGS algorithm for solving symmetric nonlinear equations, Non Monotone Backtracking Inexact BFGS Method for Regression Analysis, A trust-region-based BFGS method with line search technique for symmetric nonlinear equations, A BFGS trust-region method for nonlinear equations, Limited memory BFGS method with backtracking for symmetric nonlinear equations, Particle swarm algorithm for solving systems of nonlinear equations, A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations, BFGS trust-region method for symmetric nonlinear equations, An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations, A New Method with Descent Property for Symmetric Nonlinear Equations, A new trust-region method with line search for solving symmetric nonlinear equations

Uses Software

• ve08
• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Testing parallel variable transformation
• An SQP-type method and its application in stochastic programs
• Nonmonotone backtracking inexact quasi-Newton algorithms for solving smooth nonlinear equations
• The superlinear convergence of a modified BFGS-type method for unconstrained optimization
• Local convergence analysis for partitioned quasi-Newton updates
• New quasi-Newton methods for unconstrained optimization problems
• The “global” convergence of Broyden-like methods with suitable line search
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
• Testing Unconstrained Optimization Software
• 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
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• Convergence Properties of the BFGS Algoritm
• A New Algorithm for Unconstrained Optimization
• A modified BFGS method and its global convergence in nonconvex minimization