A three-term gradient descent method with subspace techniques

DOI10.1155/2021/8867309MaRDI QIDQ6483838zbMATH OpenFDO

Authors Shengwei Yao, Yu-Ping Wu, Jielan Yang, Jieqiong Xu

Publication date 17 May 2021

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2021/8867309

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53) Methods of reduced gradient type (90C52)

Recommendations

• A subspace conjugate gradient algorithm for large-scale unconstrained optimization
• A three-term conjugate gradient method with sufficient descent property
• A three-term conjugate gradient algorithm using subspace for large-scale unconstrained optimization
• A new three terms gradient descent algorithm
• A New Adaptive Subspace Minimization Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization

Cited in

(1)

• Modified Active Subspaces Using the Average of Gradients

This page was built for publication: A three-term gradient descent method with subspace techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6483838)