The “global” convergence of Broyden-like methods with suitable line search
From MaRDI portal
Publication:3729928
DOI10.1017/S0334270000005208zbMath0596.65034OpenAlexW2007321864WikidataQ57389737 ScholiaQ57389737MaRDI QIDQ3729928
Publication date: 1986
Published in: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0334270000005208
Iterative methodssuperlinear convergencederivative-free line searchquasi-Newton algorithmsBroyden-like methods
Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10)
Related Items (63)
Globally convergent Jacobian-free nonlinear equation solvers based on non-monotone norm descent conditions and a modified line search technique ⋮ A new adaptive trust-region method for system of nonlinear equations ⋮ A Globally Convergent Trust-Region Method for Large-Scale Symmetric Nonlinear Systems ⋮ On the local convergence of adjoint Broyden methods ⋮ Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem ⋮ A nonmonotone filter trust region method for the system of nonlinear equations ⋮ A new nonmonotone trust region method for unconstrained optimization equipped by an efficient adaptive radius ⋮ A magnetostatic energy formula arising from the \(L^2\)-orthogonal decomposition of the stray field ⋮ Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization ⋮ Global convergence of a modified Broyden family method for nonconvex functions ⋮ A trust-region-based BFGS method with line search technique for symmetric nonlinear equations ⋮ Practical quasi-Newton algorithms for singular nonlinear systems ⋮ A new black box method for monotone nonlinear equations ⋮ A modified conjugate gradient parameter via hybridization approach for solving large-scale systems of nonlinear equations ⋮ A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI ⋮ Nonmonotone spectral method for large-scale symmetric nonlinear equations ⋮ On the stable global convergence of particular quasi-newton-methods ⋮ A Five-Parameter Class of Derivative-Free Spectral Conjugate Gradient Methods for Systems of Large-Scale Nonlinear Monotone Equations ⋮ Approximate norm descent methods for constrained nonlinear systems ⋮ A new filter algorithm for a system of nonlinear equations ⋮ An accelerated conjugate gradient algorithm for solving nonlinear monotone equations and image restoration problems ⋮ A BFGS trust-region method for nonlinear equations ⋮ Limited memory BFGS method with backtracking for symmetric nonlinear equations ⋮ Global convergence of Schubert's method for solving sparse nonlinear equations ⋮ A limited memory BFGS method for solving large-scale symmetric nonlinear equations ⋮ The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients ⋮ The equivalence of strict convexity and injectivity of the gradient in bounded level sets ⋮ A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations ⋮ Nonmonotone Self-adaptive Levenberg–Marquardt Approach for Solving Systems of Nonlinear Equations ⋮ Refraction-corrected ray-based inversion for three-dimensional ultrasound tomography of the breast ⋮ A quasi-Newton algorithm for large-scale nonlinear equations ⋮ Partitioned quasi-Newton methods for sparse nonlinear equations ⋮ A BFGS algorithm for solving symmetric nonlinear equations ⋮ A new nonmonotone line-search trust-region approach for nonlinear systems ⋮ Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results ⋮ A PRP type method for systems of monotone equations ⋮ Convergence analysis of a modified BFGS method on convex minimizations ⋮ A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations ⋮ A globally convergent BFGS method for nonlinear monotone equations without any merit functions ⋮ Spectral gradient projection method for solving nonlinear monotone equations ⋮ A New Method with Descent Property for Symmetric Nonlinear Equations ⋮ A family of Hager-Zhang conjugate gradient methods for system of monotone nonlinear equations ⋮ Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications ⋮ A global convergent quasi-Newton method for systems of monotone equations ⋮ An efficient line search trust-region for systems of nonlinear equations ⋮ A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations ⋮ A modified Broyden-like quasi-Newton method for nonlinear equations ⋮ Global convergence of quasi-Newton methods based on adjoint Broyden updates ⋮ Convergence of Broyden-like matrix ⋮ A new smoothing quasi-Newton method for nonlinear complementarity problems ⋮ A tensor trust-region model for nonlinear system ⋮ BFGS trust-region method for symmetric nonlinear equations ⋮ An efficient adaptive trust-region method for systems of nonlinear equations ⋮ A new trust-region method with line search for solving symmetric nonlinear equations ⋮ A new backtracking inexact BFGS method for symmetric nonlinear equations ⋮ An effective trust-region-based approach for symmetric nonlinear systems ⋮ Multipoint secant and interpolation methods with nonmonotone line search for solving systems of nonlinear equations ⋮ Practical quasi-Newton methods for solving nonlinear systems ⋮ Efficient calibration of the Hull White model ⋮ Solvability for boundary value problem of the general Schrödinger equation with general superlinear nonlinearity ⋮ A derivative-free line search and global convergence of Broyden-like method for nonlinear equations ⋮ A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence ⋮ Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing
This page was built for publication: The “global” convergence of Broyden-like methods with suitable line search