Notes on the Dai-Yuan-Yuan modified spectral gradient method

DOI10.1016/j.cam.2010.04.012zbMath1195.65081OpenAlexW2073938719MaRDI QIDQ984907

J. Martínez

Publication date: 20 July 2010

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

Full work available at URL: https://doi.org/10.1016/j.cam.2010.04.012

zbMATH Keywords

global convergencenumerical experimentsspectral gradient methodnonmonotone line searchquasi-Newton methodsecant equation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)

Related Items (14)

An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization ⋮ A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem ⋮ A new adaptive Barzilai and Borwein method for unconstrained optimization ⋮ Scaling on the spectral gradient method ⋮ Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization ⋮ Unnamed Item ⋮ Structured two-point stepsize gradient methods for nonlinear least squares ⋮ An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization ⋮ Global convergence of a nonlinear conjugate gradient method ⋮ A hybrid BB-type method for solving large scale unconstrained optimization ⋮ Two effective hybrid conjugate gradient algorithms based on modified BFGS updates ⋮ An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization ⋮ Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search ⋮ The new spectral conjugate gradient method for large-scale unconstrained optimisation

Uses Software

• CUTEr

Cites Work

• A limited memory BFGS-type method for large-scale unconstrained optimization
• Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
• New quasi-Newton equation and related methods for unconstrained optimization
• Modified two-point stepsize gradient methods for unconstrained optimization
• The superlinear convergence of a modified BFGS-type method for unconstrained optimization
• Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
• New quasi-Newton methods for unconstrained optimization problems
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Two-Point Step Size Gradient Methods
• Gradient Method with Retards and Generalizations
• CUTE
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• The cyclic Barzilai-–Borwein method for unconstrained optimization
• Benchmarking optimization software with performance profiles.
• On the nonmonotone line search

This page was built for publication: Notes on the Dai-Yuan-Yuan modified spectral gradient method