Regular splitting and potential reduction method for solving quadratic programming problem with box constraints

	Regular splitting and potential reduction method for solving quadratic programming problem with box constraints
	Wei, ZL
刊名	JOURNAL OF COMPUTATIONAL MATHEMATICS
	2002-11-01
卷号	20 期号:6 页码:643-652
关键词	quadratic programming problem regular splitting potential reduction algorithm complexity analysis
ISSN号	0254-9409
英文摘要	A regular splitting and potential reduction method is presented for solving a quadratic programming problem with box constraints (QPB) in this paper. A general algorithm is designed to solve the QPB problem and generate a sequence of iterative points. We show that the number : of iterations to generate an E-minimum solution or an epsilon-KKT solution by the algorithm is bounded by O(n(2)/epsilon log 1/epsilon + nlog(1 + root2n)), and the total running time is bounded by O(n(2) (n + logn + log 1(epsilon)/epsilon)(n(epsilon)/epsilon log 1/epsilon + logn)) arithmetic operations.
语种	英语
出版者	VSP BV
WOS记录号	WOS:000179620000009
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/17225]
专题	中国科学院数学与系统科学研究院
作者单位	Chinese Acad Sci, Acad Math & Syst Sci, Inst Comput Math & Sci Engn Comput, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Wei, ZL. Regular splitting and potential reduction method for solving quadratic programming problem with box constraints[J]. JOURNAL OF COMPUTATIONAL MATHEMATICS,2002,20(6):643-652.
APA	Wei, ZL.(2002).Regular splitting and potential reduction method for solving quadratic programming problem with box constraints.JOURNAL OF COMPUTATIONAL MATHEMATICS,20(6),643-652.
MLA	Wei, ZL."Regular splitting and potential reduction method for solving quadratic programming problem with box constraints".JOURNAL OF COMPUTATIONAL MATHEMATICS 20.6(2002):643-652.