Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem

DOI10.1007/s40314-016-0308-xzbMath1383.65062OpenAlexW2254377731MaRDI QIDQ2403122

Halima Lakhbab, Souad El Bernoussi

Publication date: 15 September 2017

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-016-0308-x

zbMATH Keywords

numerical exampleglobal convergenceunconstrained minimizationspectral gradient methodnonmonotone line searchBarzilai-Borwein methodparticle swarm optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Stochastic programming (90C15)

Related Items (1)

A hybrid BB-type method for solving large scale unconstrained optimization

Uses Software

• SPG

Cites Work

• Hybrid spectral gradient method for the unconstrained minimization problem
• Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Two-Point Step Size Gradient Methods
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• A Nonmonotone Line Search Technique for Newton’s Method
• Algorithm 813
• Unnamed Item
• Unnamed Item

This page was built for publication: Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem