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

一种新的求解非线性互补问题的Derivative-Free算法
引用本文:蒋利华,刘丽华. 一种新的求解非线性互补问题的Derivative-Free算法[J]. 安徽理工大学学报(自然科学版), 2006, 26(3): 81-84
作者姓名:蒋利华  刘丽华
作者单位:1. 安徽理工大学数理系,安徽,淮南,232001;桂林电子科技大学计算科学与数学系,广西,桂林,541004
2. 桂林电子科技大学计算科学与数学系,广西,桂林,541004
基金项目:国家自然科学基金 , 广西自然科学基金
摘    要:把NCP(F)通过约束极小化变形转化为无约束极小化问题,构造一种新的Derivative-Free下降算法,并在一定条件下证明了Derivative-Free下降算法的合理性及整体收敛性.

关 键 词:非线性互补问题(NCP(F))  Derivative-Free下降算法  整体收敛性
文章编号:1672-1098(2006)03-0081-04
收稿时间:2006-01-13
修稿时间:2006-01-13

A New Derivative-free Descent Method for Nonlinear Complementarity Problems
JIANG Li-hua,LIU Li-hua. A New Derivative-free Descent Method for Nonlinear Complementarity Problems[J]. Journal of Anhui University of Science and Technology:Natural Science, 2006, 26(3): 81-84
Authors:JIANG Li-hua  LIU Li-hua
Affiliation:1. Dept. of Mathematics and Physics, Anhui University of Science and Technology, Huainan Anhui 232001,China; 2. Dept. of Computer Science and Mathematics, Guilin University of Electronic Technology, Guilin Guangxi 541004,China
Abstract:A new globally convergent derivative-free descent method for solving nonlinear complementarity problems is proposed based on its equivalent formulation of minimization. The reasonable and global convergence of the method is verified.
Keywords:nonlinear complementarity problems NCP(F)  derivative-free descent algorithm  global convergence
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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