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

广义互补问题的正则化牛顿算法
引用本文:曹媛媛.广义互补问题的正则化牛顿算法[J].科学技术与工程,2009,9(24).
作者姓名:曹媛媛
作者单位:曲阜师范大学杏坛学院,曲阜,273100
基金项目:国家自然科学基金项目: 
摘    要:首先将定义在闭凸多面锥上的广义互补问题(GNCP)转化为一个等价的非线性方程组,然后利用正则化牛顿算法来求解此非线性方程组,并建立了算法的超线性(二阶)收敛性.

关 键 词:广义互补问题  正则化牛顿算法  半光滑  广义Jocobian  非奇异性条件
收稿时间:2009/9/19 0:00:00
修稿时间:9/29/2009 9:24:39 AM

A REGUARIZATION-NEWTON ALGORITHM FOR THE GENERALIZED
caoyuanyuan.A REGUARIZATION-NEWTON ALGORITHM FOR THE GENERALIZED[J].Science Technology and Engineering,2009,9(24).
Authors:caoyuanyuan
Abstract:In this paper, the generalized nonlinear complementarity problem (GNCP) over a polyhedral cone is considered. To solve the problem, we first reformulate it as a system of nonlinear equations, and then develop a regularization-Newton algorithm to solve it, the global convergence and superlinear convergence rate of the algorithm are also analyzed in this thesis. KEYWORD: General Nonlinear Complementarity Problem; Regularization-Newton Method; Semismooth;Generalized Jocobian; Nonsingularity condition.
Keywords:General Nonlinear Complementarity Problem  Regularization-Newton Method  Semismooth  Generalized Jocobian  Nonsingularity condition
本文献已被 万方数据 等数据库收录!
点击此处可从《科学技术与工程》浏览原始摘要信息
点击此处可从《科学技术与工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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