A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
From MaRDI portal
Publication:742397
DOI10.1007/s11590-013-0678-6zbMath1305.90389OpenAlexW2074191451MaRDI QIDQ742397
Yu Chen, Zhong Wan, Shuai Huang, Dongdong Feng
Publication date: 18 September 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-013-0678-6
Related Items
An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems ⋮ A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization ⋮ A new nonmonotone spectral residual method for nonsmooth nonlinear equations ⋮ Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization ⋮ An extended nonmonotone line search technique for large-scale unconstrained optimization ⋮ A derivative-free multivariate spectral projection algorithm for constrained nonlinear monotone equations ⋮ Empirical analysis and optimization of capital structure adjustment ⋮ A new conjugate gradient projection method for convex constrained nonlinear equations ⋮ OPTIMAL DECISION MAKING FOR ONLINE AND OFFLINE RETAILERS UNDER BOPS MODE ⋮ A new nonmonotone line search technique for unconstrained optimization ⋮ On efficiency of nonmonotone Armijo-type line searches ⋮ A globally convergent BFGS method for symmetric nonlinear equations ⋮ A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems ⋮ NEW ADAPTIVE BARZILAI–BORWEIN STEP SIZE AND ITS APPLICATION IN SOLVING LARGE-SCALE OPTIMIZATION PROBLEMS ⋮ A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function ⋮ The higher-order Levenberg–Marquardt method with Armijo type line search for nonlinear equations
Cites Work
- Unnamed Item
- Unnamed Item
- The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions
- A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- A new backtracking inexact BFGS method for symmetric nonlinear equations
- Inexact trust region method for large sparse systems of nonlinear equations
- Globally convergent inexact quasi-Newton methods for solving nonlinear systems
- Practical quasi-Newton methods for solving nonlinear systems
- Nonmonotone backtracking inexact quasi-Newton algorithms for solving smooth nonlinear equations
- Global convergence properties of the modified BFGS method associating with general line search model
- A class on nonmonotone stabilization methods in unconstrained optimization
- Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
- Recent progress in the global convergence of quasi-Newton methods for nonlinear equations
- Convergence of nonmonotone line search method
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations
This page was built for publication: A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
