| A Null Space Approach for Solving Nonlinear Complementarity Problems |
| |
| 引用本文： | Pu-yan Nie. A Null Space Approach for Solving Nonlinear Complementarity Problems[J]. 应用数学学报(英文版), 2006, 22(1): 9-20. DOI: 10.1007/s10255-005-0279-y |
| |
| 作者姓名： | Pu-yan Nie |
| |
| 作者单位： | Department of Mathematics, College of Information Science and Technology, Jinan University, Guangzhou 510632, China |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China （No.10501019） and the Scientific Research Foundation for the Returned 0verseas Chinese Scholars, State Education Ministry. Acknowledgment The author is grateful to an anonymous reieree for helpful comments and suggestions on an earlier version of the paper. |
| |
| 摘 要： | In this work, null space techniques are employed to tackle nonlinear complementarity problems （NCPs）. NCP conditions are transform into a nonlinear programming problem, which is handled by null space algorithms, The NCP conditions are divided into two groups, Some equalities and inequalities in an NCP are treated as constraints, While other equalities and inequalities in an NCP are to be regarded as objective function. Two groups are all updated in every step. Null space approaches are extended to nonlinear complementarity problems. Two different solvers are employed for all NCP in an algorithm.
|
| 关 键 词： | 整体收敛 非线性互补 非线性规划 空值空间 |
| 收稿时间： | 2002-09-12 |
| 修稿时间： | 2002-09-122004-07-12 |
A Null Space Approach for Solving Nonlinear Complementarity Problems |
| |
| Pu-yan Nie. A Null Space Approach for Solving Nonlinear Complementarity Problems[J]. Acta Mathematicae Applicatae Sinica, 2006, 22(1): 9-20. DOI: 10.1007/s10255-005-0279-y |
| |
| Authors: | Pu-yan Nie |
| |
| Affiliation: | (1) Department of Mathematics, College of Information Science and Technology, Jinan University, Guangzhou |
| |
| Abstract: | Abstract In this work, null space techniques are employed to tackle nonlinear complementarity problems (NCPs). NCP conditions are transform into a nonlinear programming problem, which is handled by null space algorithms. The NCP conditions are divided into two groups. Some equalities and inequalities in an NCP are treated as constraints. While other equalities and inequalities in an NCP are to be regarded as objective function. Two groups are all updated in every step. Null space approaches are extended to nonlinear complementarity problems. Two different solvers are employed for an NCP in an algorithm. Supported by the National Natural Science Foundation of China (No.10501019) and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry. |
| |
| Keywords: | Global convergence Nonlinear complementarity problem nonlinear programming null space methods |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
