中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
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.
语种英语
WOS记录号WOS:000179620000009
出版者VSP BV
源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.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。