A quasi-Newton algorithm for large-scale nonlinear equations

DOI10.1186/s13660-017-1301-7zbMath1358.65037OpenAlexW2583271252WikidataQ41879661 ScholiaQ41879661MaRDI QIDQ509967

Linghua Huang

Publication date: 16 February 2017

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-017-1301-7

zbMATH Keywords

algorithmglobal convergencenumerical resultsnonlinear equationsnonmonotone line searchquasi-Newton methodconjugate gradientlarge-scale

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items

Generalized SOR-like iteration method for solving weakly nonlinear systems, A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems

Uses Software

• minpack

Cites Work

• Unnamed Item
• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
• A BFGS trust-region method for nonlinear equations
• Limited memory BFGS method with backtracking 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
• Nonmonotone line search for minimax problems
• Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions
• A survey of truncated-Newton methods
• Nonmonotone backtracking inexact quasi-Newton algorithms for solving smooth nonlinear equations
• Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
• A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
• Color image analysis by quaternion-type moments
• Variational iteration technique for solving a system of nonlinear equations
• New line search methods for unconstrained optimization
• A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization
• THE BARZILAI AND BORWEIN GRADIENT METHOD WITH NONMONOTONE LINE SEARCH FOR NONSMOOTH CONVEX OPTIMIZATION PROBLEMS
• A New Method with Descent Property for Symmetric Nonlinear Equations
• A Trust Region Algorithm with Conjugate Gradient Technique for Optimization Problems
• A new trust-region method with line search for solving symmetric nonlinear equations
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• MODIFIED LIMITED MEMORY BFGS METHOD WITH NONMONOTONE LINE SEARCH FOR UNCONSTRAINED OPTIMIZATION
• Local Convergence of Inexact Newton Methods
• The “global” convergence of Broyden-like methods with suitable line search
• Testing Unconstrained Optimization Software
• Inexact Newton Methods
• Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
• Convergence Theory of Nonlinear Newton–Krylov Algorithms
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
• A Nonmonotone Line Search Technique for Newton’s Method
• Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations
• A BFGS algorithm for solving symmetric nonlinear equations
• The conjugate gradient method in extremal problems
• Benchmarking optimization software with performance profiles.