agloballyandsuperlinearlyconvergenttrustregionmethodforlc1optimizationproblems

CSpace

	agloballyandsuperlinearlyconvergenttrustregionmethodforlc1optimizationproblems
	Zhang Liping; Lai Yanlian
	2001
发表期刊	appliedmathematicsseriesbajournalofchineseuniversities
ISSN	1005-1031
卷号	016 期号:001 页码:72
摘要	Abstract. 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.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/38487
专题	中国科学院数学与系统科学研究院
作者单位	中国科学院数学与系统科学研究院
推荐引用方式 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.