A memory gradient method for non-smooth convex optimization

DOI10.1080/00207160.2014.955483zbMath1317.90284OpenAlexW2034189051MaRDI QIDQ5266154

Yuanwen Liu, Yi-gui Ou

Publication date: 30 July 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.955483

zbMATH Keywords

convergence analysisnon-monotone line searchmemory gradient methodnon-smooth convex optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Cites Work

• Unnamed Item
• An approximate quasi-Newton bundle-type method for nonsmooth optimization
• A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
• A gradient-related algorithm with inexact line searches
• A nonmonotone supermemory gradient algorithm for unconstrained optimization
• Global convergence of a memory gradient method for unconstrained optimization
• A new trust region algorithm for nonsmooth convex minimization
• Proximal quasi-Newton methods for nondifferentiable convex optimization
• Globally convergent BFGS method for nonsmooth convex optimization
• A trust region method for nonsmooth convex optimization
• A new variant of the memory gradient method for unconstrained optimization
• Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
• Conjugate gradient type methods for the nondifferentiable convex minimization
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
• Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
• On memory gradient method with trust region for unconstrained optimization
• A new super-memory gradient method with curve search rule
• Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
• Numerical methods for nondifferentiable convex optimization
• New limited memory bundle method for large-scale nonsmooth optimization

This page was built for publication: A memory gradient method for non-smooth convex optimization