MODIFIED LIMITED MEMORY BFGS METHOD WITH NONMONOTONE LINE SEARCH FOR UNCONSTRAINED OPTIMIZATION
From MaRDI portal
Publication:3576364
DOI10.4134/JKMS.2010.47.4.767zbMath1193.65105OpenAlexW2107832525MaRDI QIDQ3576364
Yanlin Wu, Zeng-xin Wei, Gong Lin Yuan
Publication date: 30 July 2010
Published in: Journal of the Korean Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4134/jkms.2010.47.4.767
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items (14)
A modified nonmonotone BFGS algorithm for unconstrained optimization ⋮ Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions ⋮ Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization ⋮ An active-set projected trust region algorithm for box constrained optimization problems ⋮ A modified secant equation quasi-Newton method for unconstrained optimization ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ A quasi-Newton algorithm for large-scale nonlinear equations ⋮ A BFGS algorithm for solving symmetric nonlinear equations ⋮ A modified three-term PRP conjugate gradient algorithm for optimization models ⋮ A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs ⋮ A Trust Region Algorithm with Conjugate Gradient Technique for Optimization Problems ⋮ A tensor trust-region model for nonlinear system ⋮ A new type of quasi-Newton updating formulas based on the new quasi-Newton equation ⋮ An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
Uses Software
This page was built for publication: MODIFIED LIMITED MEMORY BFGS METHOD WITH NONMONOTONE LINE SEARCH FOR UNCONSTRAINED OPTIMIZATION
