CSpace
A new memory gradient method under exact line search
Shi, ZJ
2003-11-01
Source PublicationASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
ISSN0217-5959
Volume20Issue:2Pages:275-284
AbstractThe paper presents a new memory gradient method for unconstrained optimization problem, and proves the convergence of the algorithm under exact line searches. The linear convergence rate is investigated when the objective function is uniformly convex. Numerical experiments show that the new algorithm is very effective in practice.
Keywordunconstrained optimization memory gradient method exact line search convergence numerical experiment
Language英语
WOS Research AreaOperations Research & Management Science
WOS SubjectOperations Research & Management Science
WOS IDWOS:000187459600009
PublisherASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
Citation statistics
Cited Times:10[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/18209
Collection中国科学院数学与系统科学研究院
Affiliation1.Qufu Normal Univ, Coll Operat Res & Management, Rizhao 276826, Shandong, Peoples R China
2.Chinese Acad Sci, Inst Computat Math & Sci Engn Comp, Beijing 100080, Peoples R China
Recommended Citation
GB/T 7714
Shi, ZJ. A new memory gradient method under exact line search[J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH,2003,20(2):275-284.
APA Shi, ZJ.(2003).A new memory gradient method under exact line search.ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH,20(2),275-284.
MLA Shi, ZJ."A new memory gradient method under exact line search".ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 20.2(2003):275-284.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Shi, ZJ]'s Articles
Baidu academic
Similar articles in Baidu academic
[Shi, ZJ]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Shi, ZJ]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.