CSpace
agloballyandsuperlinearlyconvergenttrustregionmethodforlc1optimizationproblems
Zhang Liping; Lai Yanlian
2001
Source Publicationappliedmathematicsseriesbajournalofchineseuniversities
ISSN1005-1031
Volume016Issue:001Pages:72
AbstractAbstract. A new trust region algorithm for solving convex LC1 optimization problem is present-ed. It is proved that the algorithm is globally convergent and the rate of convergence is superlin-ear under some reasonable assumptions.
Language英语
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/38487
Collection中国科学院数学与系统科学研究院
Affiliation中国科学院数学与系统科学研究院
Recommended Citation
GB/T 7714
Zhang Liping,Lai Yanlian. agloballyandsuperlinearlyconvergenttrustregionmethodforlc1optimizationproblems[J]. appliedmathematicsseriesbajournalofchineseuniversities,2001,016(001):72.
APA Zhang Liping,&Lai Yanlian.(2001).agloballyandsuperlinearlyconvergenttrustregionmethodforlc1optimizationproblems.appliedmathematicsseriesbajournalofchineseuniversities,016(001),72.
MLA Zhang Liping,et al."agloballyandsuperlinearlyconvergenttrustregionmethodforlc1optimizationproblems".appliedmathematicsseriesbajournalofchineseuniversities 016.001(2001):72.
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
[Zhang Liping]'s Articles
[Lai Yanlian]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhang Liping]'s Articles
[Lai Yanlian]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhang Liping]'s Articles
[Lai Yanlian]'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.