THE BARZILAI AND BORWEIN GRADIENT METHOD WITH NONMONOTONE LINE SEARCH FOR NONSMOOTH CONVEX OPTIMIZATION PROBLEMS
From MaRDI portal
Publication:2884915
DOI10.3846/13926292.2012.661375zbMath1242.90170OpenAlexW2048029112MaRDI QIDQ2884915
Publication date: 18 May 2012
Published in: Mathematical Modelling and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3846/13926292.2012.661375
Related Items (15)
An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization ⋮ A new approach to improve ill-conditioned parabolic optimal control problem via time domain decomposition ⋮ An ODE-like nonmonotone method for nonsmooth convex optimization ⋮ A modified nonmonotone BFGS algorithm for unconstrained optimization ⋮ Multivariate spectral gradient algorithm for nonsmooth convex optimization problems ⋮ An efficient conjugate gradient method with strong convergence properties for non-smooth optimization ⋮ A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization ⋮ A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization ⋮ A quasi-Newton algorithm for large-scale nonlinear equations ⋮ A modified three-term PRP conjugate gradient algorithm for optimization models ⋮ Alternating direction multiplier method for matrix \(l_{2,1}\)-norm optimization in multitask feature learning problems ⋮ An effective adaptive trust region algorithm for nonsmooth minimization ⋮ A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations ⋮ Optimal control of viscous Burgers equation via an adaptive nonmonotone Barzilai–Borwein gradient method
This page was built for publication: THE BARZILAI AND BORWEIN GRADIENT METHOD WITH NONMONOTONE LINE SEARCH FOR NONSMOOTH CONVEX OPTIMIZATION PROBLEMS
