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

凸约束伪单调方程组的无导数投影算法
引用本文:刘金魁,孙悦,赵永祥.凸约束伪单调方程组的无导数投影算法[J].计算数学,2021,43(3):388-400.
作者姓名:刘金魁  孙悦  赵永祥
作者单位:重庆三峡学院数学与统计学院,万州404100
基金项目:重庆市教育委员会科学技术研究计划青年项目(KJQN202001201),重庆三峡学院重大培育项目(16PY12),重庆市高等学校重点实验室((2017)3)资助.
摘    要:基于HS共轭梯度法的结构,本文在弱假设条件下建立了一种求解凸约束伪单调方程组问题的迭代投影算法.该算法不需要利用方程组的任何梯度或Jacobian矩阵信息,因此它适合求解大规模问题.算法在每一次迭代中都能产生充分下降方向,且不依赖于任何线搜索条件.特别是,我们在不需要假设方程组满足Lipschitz条件下建立了算法的全...

关 键 词:非线性方程组  无导数投影法  共轭梯度法  全局收敛  R-线收敛速度
收稿时间:2020-01-05

A DERIVATIVE-FREE PROJECTION ALGORITHM FOR SOLVING PSEUDO-MONOTONE EQUATIONS WITH CONVEX CONSTRAINTS
Liu Jinkui,Sun Yue,Zhao Yongxiang.A DERIVATIVE-FREE PROJECTION ALGORITHM FOR SOLVING PSEUDO-MONOTONE EQUATIONS WITH CONVEX CONSTRAINTS[J].Mathematica Numerica Sinica,2021,43(3):388-400.
Authors:Liu Jinkui  Sun Yue  Zhao Yongxiang
Institution:School of Mathematics and Statistics, Chongqing Three Gorges University, Wanzhou 404100, China
Abstract:Based on the structure of the HS conjugate gradient method, we propose an iterative projection algorithm for solving nonlinear pseudo-monotone equations with convex constraints under one weak assumption. Since the proposed method does not need any gradient or Jacobian matrix information of equations, it is suitable to solve large-scale problems. The proposed algorithm generates a sufficient descent direction in per-iteration, which is independent of any line search. Moreover, the global convergence and R-linear convergence rate of the proposed method are proved without the assumption that nonlinear equations satisfies Lipschitz condition.The numerical results show that the proposed method is stable and effective for the given large-scale nonlinear equations with convex constraints.
Keywords:Nonlinear equations  Derivative-free projection method  Conjugate gradient method  Global convergence  R-linear convergence rate  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算数学》浏览原始摘要信息
点击此处可从《计算数学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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