Compute a Celis-Dennis-Tapia step

	Compute a Celis-Dennis-Tapia step
	Li, GD ; Yuan, YX
	2005-09-01
发表期刊	JOURNAL OF COMPUTATIONAL MATHEMATICS
ISSN	0254-9409
卷号	23 期号:5 页码:463-478
摘要	In this paper, we present an algorithm for the CDT subproblem. This problem stems from computing a trust region step of an algorithm, which was first proposed by Celis, Dennis and Tapia for equality constrained optimization. Our algorithm considers general case of the CDT subproblem, convergence of the algorithm is proved. Numerical examples are also provided.
关键词	the CDT subproblem local solution global solution dual function
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied ; Mathematics
WOS记录号	WOS:000232012900002
出版者	VSP BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/1033
专题	计算数学与科学工程计算研究所
通讯作者	Li, GD
作者单位	1.Beijing Univ Technol, Coll Appl Sci, Beijing 100022, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Li, GD,Yuan, YX. Compute a Celis-Dennis-Tapia step[J]. JOURNAL OF COMPUTATIONAL MATHEMATICS,2005,23(5):463-478.
APA	Li, GD,&Yuan, YX.(2005).Compute a Celis-Dennis-Tapia step.JOURNAL OF COMPUTATIONAL MATHEMATICS,23(5),463-478.
MLA	Li, GD,et al."Compute a Celis-Dennis-Tapia step".JOURNAL OF COMPUTATIONAL MATHEMATICS 23.5(2005):463-478.