Multivariate spectral gradient algorithm for nonsmooth convex optimization problems

DOI10.1155/2015/145323zbMath1394.90456OpenAlexW1543207628WikidataQ59117367 ScholiaQ59117367MaRDI QIDQ1664763

Yaping Hu

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/145323

Mathematics Subject Classification ID

Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (1)

An efficient conjugate gradient method with strong convergence properties for non-smooth optimization

Uses Software

• PNEW

Cites Work

• Unnamed Item
• A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
• A multivariate spectral projected gradient method for bound constrained optimization
• Multivariate spectral gradient method for unconstrained optimization
• Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
• Convergence analysis of some methods for minimizing a nonsmooth convex function
• A bundle-Newton method for nonsmooth unconstrained minimization
• Convergence of some algorithms for convex minimization
• A new method for nonsmooth convex optimization
• A trust region method for nonsmooth convex optimization
• Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
• Conjugate gradient type methods for the nondifferentiable convex minimization
• Multivariate spectral gradient projection method for nonlinear monotone equations with convex constraints
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
• A nonsmooth version of Newton's method
• THE BARZILAI AND BORWEIN GRADIENT METHOD WITH NONMONOTONE LINE SEARCH FOR NONSMOOTH CONVEX OPTIMIZATION PROBLEMS
• A descent algorithm for nonsmooth convex optimization
• Optimization and nonsmooth analysis
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization

This page was built for publication: Multivariate spectral gradient algorithm for nonsmooth convex optimization problems