首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A feasible decomposition method for constrained equations and its application to complementarity problems
Authors:Xiang-li Li  Hong-wei Liu  Chang-he Liu
Institution:Xiang-li Li 1,Hong-wei Liu 1,Chang-he Liu 1,2 1 Department of Mathematics,Xidian University,Xian 710071,China 2 Department of Applied Mathematics,Henan University of Science and Technology,Luoyang 471003,China
Abstract:In this paper, by analyzing the propositions of solution of the convex quadratic programming with nonnegative constraints, we propose a feasible decomposition method for constrained equations. Under mild conditions, the global convergence can be obtained. The method is applied to the complementary problems. Numerical results are also given to show the efficiency of the proposed method.
Keywords:convex quadratic programming  nonnegative constraints  feasible decomposition method  
本文献已被 CNKI 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号