刘金魁, 孙悦, 赵永祥

重庆三峡学院 数学与统计学院, 万州 404100

收稿日期:2020-01-05出版日期:2021-08-15发布日期:2021-08-20


基金资助:重庆市教育委员会科学技术研究计划青年项目（KJQN202001201），重庆三峡学院重大培育项目（16PY12），重庆市高等学校重点实验室（（2017）3）资助.

A DERIVATIVE-FREE PROJECTION ALGORITHM FOR SOLVING PSEUDO-MONOTONE EQUATIONS WITH CONVEX CONSTRAINTS

Liu Jinkui, Sun Yue, Zhao Yongxiang

School of Mathematics and Statistics, Chongqing Three Gorges University, Wanzhou 404100, China

Received:2020-01-05Online:2021-08-15Published:2021-08-20







摘要
图/表
参考文献
相关文章
编辑推荐
-->Metrics
本文评论

基于HS共轭梯度法的结构，本文在弱假设条件下建立了一种求解凸约束伪单调方程组问题的迭代投影算法.该算法不需要利用方程组的任何梯度或Jacobian矩阵信息，因此它适合求解大规模问题.算法在每一次迭代中都能产生充分下降方向，且不依赖于任何线搜索条件.特别是，我们在不需要假设方程组满足Lipschitz条件下建立了算法的全局收敛性和R-线收敛速度.数值结果表明，该算法对于给定的大规模方程组问题是稳定和有效的.
MR(2010)主题分类:
65H10
90C30
分享此文:

()

[1] Meintjes K, Morgan A P. A methodology for solving chemical equilibrium systems[J]. Applied Mathematics and Computation, 1987, 22:333-361. [2] Dirkse S P, Ferris M C. MCPLIB:A collection of nonlinear mixed complementarity problems[J]. Optimization Methods and Software, 1995, 5:319-345. [3] Dennis J E, More J J. A characterization of superlinear convergence and its application to quasiNewton methods[J]. Mathematics of Computation, 1974, 28:549-560. [4] Iusem A N, Solodov M V. Newton-type methods with generalized distances for constrained optimization[J]. Optimization, 1997, 44:257-278. [5] Zhao Y B, Li D. Monotonicity of fixed point and normal mapping associated with variational inequality and its application[J]. SIAM Journal on Optimization, 2001, 4:962-973. [6] Solodov M V, Svaiter B F. A Globally Convergent Inexact Newton Method for Systems of Monotone Equations[M]. Kluwer:Kluwer Academic Publisher, 1988, 355-369. [7] Kanzow C, Yamashita N, Fukushima M. Levenberg-Marquardt methods for constrained nonlinear equations with strong local convergence properties[J]. Journal of Computational and Applied Mathematics, 2004, 172:375-397. [8] Tong X J, Qi L, Yang Y F. The Lagrangian globalization method for nonsmooth constrained equations[J]. Computational Optimization and Applications, 2006, 33:89-109. [9] Zhou W J, Li D H. A globally convergent BFGS method for nonlinear monotone equations without any merit functions[J]. Mathematics of Computation, 2008, 77:2231-2240. [10] Zhou G, Toh K C. Superline convergence of a Newton-type algorithm for monotone equations[J]. Journal of Optimization Theory with Applications, 2005, 125:205-221. [11] Zhang L, Zhou W J. Spectral gradient projection method for solving nonlinear monotone equations[J]. Journal of Computation and Applied Mathematics, 2006, 196:478-484. [12] Cheng W Y. A PRP type method for systems of monotone equations[J]. Mathematical and Computer Modelling, 2009, 50:15-20. [13] 刘金魁. 解凸约束非线性单调方程组的无导数谱PRP投影算法[J]. 计算数学, 2016, 38:113-124. [14] Zhou W J, Li D H. On the Q-linear convergence rate of a class of methods for monotone nonlinear equations[J]. Pacific Journal of Optimization, 2018, 14:723-737. [15] Xiao Y H, Zhu H. A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing[J]. Journal of Mathematical Analysis and Applications, 2013, 405:310-319. [16] Dai Z F, Chen X H, Wen F H. A modfied Perry's conjugate gradient method-based derivativefree method for solving large-scale nonlinear monotone equations[J]. Applied Mathematics and Computations, 2015, 270:378-386. [17] Gao P T, He C J. An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints[J]. Calcolo, 2018, 55:53. [18] Hestenes M R, Stiefel E L. Methods of conjugate gradients for solving linear systems[J]. Journal of Research of the National Bureau of Standards, 1952, 49:409-436. [19] Conn A R, Gould N I M, Toint Ph L. CUTEr:constrained and unconstrained testing enviroment[J]. ACM Transactions on Mathematical Software, 1995, 21:123-160. [20] Gomez-Ruggiero M, Martínez J M, Moretti A. Comparing Algorithms for solving sparse nonlinear systems of equations[J]. SIAM Journal on Scientific Computing, 1992, 23:459-483. [21] Móre J J, Garbow B S, Hillström K E. Testing uncosntrained optimization software[J]. ACM Transactions on Mathematical Software, 1981, 7:17-41. [22] Dolan E D, Moré J J. Benchmarking optimization software with performance profiles[J]. Mathematical Programming, 2002, 91:201-213.

[1]	尹江华, 简金宝, 江羡珍. 凸约束非光滑方程组一个新的谱梯度投影算法[J]. 计算数学, 2020, 42(4): 457-471.
[2]	吴敏华, 李郴良. 求解带Toeplitz矩阵的线性互补问题的一类预处理模系矩阵分裂迭代法[J]. 计算数学, 2020, 42(2): 223-236.
[3]	张纯, 贾泽慧, 蔡邢菊. 广义鞍点问题的改进的类SOR算法[J]. 计算数学, 2020, 42(1): 39-50.
[4]	姜帆, 刘雅梅, 蔡邢菊. 一类自适应广义交替方向乘子法[J]. 计算数学, 2018, 40(4): 367-386.
[5]	王福胜, 张瑞. 不等式约束极大极小问题的一个新型模松弛强次可行SQCQP算法[J]. 计算数学, 2018, 40(1): 49-62.
[6]	裕静静, 江平, 刘植. 两类五阶解非线性方程组的迭代算法[J]. 计算数学, 2017, 39(2): 151-166.
[7]	张旭, 檀结庆, 艾列富. 一种求解非线性方程组的3p阶迭代方法[J]. 计算数学, 2017, 39(1): 14-22.
[8]	郭俊, 吴开腾, 张莉, 夏林林. 一种新的求非线性方程组的数值延拓法[J]. 计算数学, 2017, 39(1): 33-41.
[9]	刘金魁. 解凸约束非线性单调方程组的无导数谱PRP投影算法[J]. 计算数学, 2016, 38(2): 113-124.
[10]	刘亚君, 刘新为. 无约束最优化的信赖域BB法[J]. 计算数学, 2016, 38(1): 96-112.
[11]	简金宝, 尹江华, 江羡珍. 一个充分下降的有效共轭梯度法[J]. 计算数学, 2015, 37(4): 415-424.
[12]	刘群锋, 曾金平, 张忠志, 程万友. 基于混合非单调下降条件的直接搜索方法[J]. 计算数学, 2015, 37(2): 213-224.
[13]	刘晴, 檀结庆, 张旭. 一种基于Chebyshev迭代解非线性方程组的方法[J]. 计算数学, 2015, 37(1): 14-20.
[14]	王洋, 伍渝江, 付军. 一类弱非线性方程组的Picard-MHSS迭代方法[J]. 计算数学, 2014, 36(3): 291-302.
[15]	张凯院, 牛婷婷, 聂玉峰. 一类非线性矩阵方程对称解的双迭代算法[J]. 计算数学, 2014, 36(1): 75-84.

--> -->

	阅读次数
	全文
	摘要
	Cited
	Shared

PDF全文下载地址:

http://www.computmath.com/jssx/CN/article/downloadArticleFile.do?attachType=PDF&id=5165