Fixed-Point Iteration Method for Solving the Convex Quadratic Programming with Mixed Constraints  被引量:1

Fixed-Point Iteration Method for Solving the Convex Quadratic Programming with Mixed Constraints

在线阅读下载全文

作  者:Ruopeng Wang Hong Shi Kai Ruan Xiangyu Gao 

机构地区:[1]Department of Mathematics & Physics, Beijing Institute of Petrochemical Technology, Beijing, China

出  处:《Applied Mathematics》2014年第2期256-262,共7页应用数学(英文)

摘  要:The present paper is devoted to a novel smoothing function method for convex quadratic programming problem with mixed constrains, which has important application in mechanics and engineering science. The problem is reformulated as a system of non-smooth equations, and then a smoothing function for the system of non-smooth equations is proposed. The condition of convergences of this iteration algorithm is given. Theory analysis and primary numerical results illustrate that this method is feasible and effective.The present paper is devoted to a novel smoothing function method for convex quadratic programming problem with mixed constrains, which has important application in mechanics and engineering science. The problem is reformulated as a system of non-smooth equations, and then a smoothing function for the system of non-smooth equations is proposed. The condition of convergences of this iteration algorithm is given. Theory analysis and primary numerical results illustrate that this method is feasible and effective.

关 键 词:FIXED-POINT ITERATION CONVEX QUADRATIC Programming Problem Convergence SMOOTHING Function 

分 类 号:O1[理学—数学]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象