Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A three-term conjugate gradient algorithm using subspace for large-scale unconstrained optimization

From MaRDI portal
Publication:2023548
Jump to:navigation, search

DOI10.4310/CMS.2020.V18.N5.A1zbMath1460.65067OpenAlexW3088880398MaRDI QIDQ2023548

Yu-Ting Chen, Yue-Ting Yang

Publication date: 3 May 2021

Published in: Communications in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/cms.2020.v18.n5.a1


zbMATH Keywords

subspaceunconstrained optimizationglobal convergencethree-term conjugate gradient methodlarge-scale


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)


Related Items (1)

A three-term conjugate gradient method with a random parameter for large-scale unconstrained optimization and its application in regression model







This page was built for publication: A three-term conjugate gradient algorithm using subspace for large-scale unconstrained optimization

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2023548&oldid=14491685"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 18:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki