A self-adjusting spectral conjugate gradient method for large-scale unconstrained optimization

DOI10.1155/2013/814912zbMath1278.90389OpenAlexW2053031072WikidataQ58917527 ScholiaQ58917527MaRDI QIDQ370232

Dandan Cui, Gaohang Yu, Wei Xue, Yuan-ying Qiu

Publication date: 19 September 2013

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/814912

zbMATH Keywords

Wolfe conditionsself-adjusting property

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Uses Software

• CUTEr

Cites Work

• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
• Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• New properties of a nonlinear conjugate gradient method
• Benchmarking optimization software with performance profiles.
• An efficient hybrid conjugate gradient method for unconstrained optimization

This page was built for publication: A self-adjusting spectral conjugate gradient method for large-scale unconstrained optimization