| 求解双障碍问题的一个内点迭代算法 |
| |
| 引用本文： | 吴绪权.求解双障碍问题的一个内点迭代算法[J].武汉理工大学学报(交通科学与工程版),2008,32(6). |
| |
| 作者姓名： | 吴绪权 |
| |
| 作者单位： | 武汉理工大学理学院,武汉,430063 |
| |
| 基金项目： | 国家科学技术协会重点项目资助
|
| |
| 摘 要： | 介绍一种解决双障碍问题的迭代算法,该算法称之为内点迭代算法. 首先将原问题转化为等价非光滑方程组,然后构造新的光滑函数来逼近非光滑方程组. 文中证明了惩罚参数可能需要修正有限次情形下算法的全局收敛性和超线性收敛性. 经数值实验表明,该算法是有效的.
|
| 关 键 词： | 双障碍问题 内点迭代算法 收敛性定理 |
An Interior-point Iterative Method for the Bi-obstacle Problems |
| |
| Wu Xuquan.An Interior-point Iterative Method for the Bi-obstacle Problems[J].journal of wuhan university of technology(transportation science&engineering),2008,32(6). |
| |
| Authors: | Wu Xuquan |
| |
| Institution: | College of Science;WUT;Wuhan 430063 |
| |
| Abstract: | Bi-obstacle problem is an important variational inequality.This paper presents a new iterative method which is called interior-point-iterative algorithm for solving the bi-obstacle problems.Firstly,we translate original problems into non-smooth equivalent equations,then structure new smooth function equations to approximate to the non-smooth equations.The paper proves the global convergence of algorithms and ultra linear of convergence when the punishment parameters might need to amend limited times.Numeric... |
| |
| Keywords: | bi-obstacle problems interior-point-iterative algorithm convergence theorem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
