• 论文 • 上一篇
于冬梅1, 王增伟1, 陈彩荣2, 韩德仁3
于冬梅, 王增伟, 陈彩荣, 韩德仁. 求解二阶锥绝对值方程组的非单调光滑牛顿算法[J]. 计算数学, 2023, 45(2): 251-266.
Yu Dongmei, Wang Zengwei, Chen Cairong, Han Deren. A NON-MONOTONE SMOOTHING NEWTON ALGORITHM FOR ABSOLUTE VALUE EQUATIONS ASSOCIATED WITH SECOND-ORDER CONE[J]. Mathematica Numerica Sinica, 2023, 45(2): 251-266.
Yu Dongmei1, Wang Zengwei1, Chen Cairong2, Han Deren3
MR(2010)主题分类:
分享此文:
[1] Alizadeh F, Goldfarb D. Second-order cone programming[J]. Mathematical Programming, 2003, 95:3-51. [2] Chen J S, Pan S H. A survey on SOC complementarity functions and solution methods for SOCPs and SOCCPs[J]. Pacific Journal of Optimization, 2012, 8(1):33-74. [3] Chen C R, Yu D M, Han D R. Exact and inexact Douglas-Rachford splitting methods for solving large-scale sparse absolute value equations[J]. IMA Journal of Numerical Analysis, 2022. https://doi.org/10.1093/imanum/drab105. [4] Chen C R, Yang Y N, Yu D M, Han D R. An inverse-free dynamical system for solving the absolute value equations[J]. Applied Numerical Mathematics, 2021, 168:170-181. [5] Dong X, Shao X H, Shen H L. A new SOR-like method for solving absolute value equations[J]. Applied Numerical Mathematics, 2020, 156:410-421. [6] Faraut J, Korányi A. Analysis on Symmetric Cones[M]. New York:Oxford University Press, 1994. [7] Fischer A. A special Newton-type optimization method[J]. Optimization, 1992, 24:269-284. [8] Fukushima M, Luo Z Q, Tseng P. Smoothing functions for second-order-cone complementarity problems[J]. SIAM Journal on Optimization, 2002, 12(2):436-460. [9] Hu S L, Huang Z H, Chen J S. Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems[J]. Journal of Computational and Applied Mathematics, 2009, 230:69-82. [10] Hu S L, Huang Z H, Zhang Q. A generalized Newton method for absolute value equations associated with second order cones[J]. Journal of Computational and Applied Mathematics, 2011, 235:1490-1501. [11] Huang Z H, Ni T. Smoothing algorithms for complementarity problems over symmetric cones[J]. Computational Optimization and Applications, 2010, 45:557-579. [12] Ke Y F, Ma C F. SOR-like iteration method for solving absolute value equations[J]. Applied Mathematics and Computation, 2017, 311:195-202. [13] Ke Y F. The new iteration algorithm for absolute value equation[J]. Applied Mathematics Letters, 2020, 99:105990. [14] Ju X X, Li C D, Han X, He X. Neurodynamic network for absolute value equations:A fixed-time convergence technique[J]. IEEE Transactions on Circuits and Systems II-Express Briefs, 2022, 69(3):1807-1811. [15] Mangasarian O L. Absolute value programming[J]. Computational Optimization and Applications, 2007, 36:43-53. [16] Mangasarian O L. Knapsack feasibility as an absolute value equation solvable by successive linear programming[J]. Optimization Letters, 2009, 3:161-170. [17] Mangasarian O L. A generalized Newton method for absolute value equations[J]. Optimization Letters, 2009, 3:101-108. [18] Mangasarian O L, Meyer R R. Absolute value equations[J]. Linear Algebra and its Applications, 2006, 419:359-367. [19] Mezzadri F. On the solution of general absolute value equations[J]. Applied Mathematics Letters, 2020, 107:106462. [20] Miao X H, Yang J T, Saheya B, Chen J S. A smoothing Newton method for absolute value equation associated with second-order cone[J]. Applied Numerical Mathematics, 2017, 120:82-96. [21] Miao X H, Hsu W M, Nguyen C T, Chen J S. The solvabilities of three optimization problems associated with second-order cone[J]. Journal of Nonlinear and Convex Analysis, 2021, 22(5):937-967. [22] Nguyen C T, Saheya B, Chang Y L, Chen J S. Unified smoothing functions for absolute value equation associated with second-order cone[J]. Applied Numerical Mathematics, 2019, 135:206-227. [23] Prokopyev O. On equivalent reformulations for absolute value equations[J]. Computational Optimization and Applications, 2009, 44:363-372. [24] Qi L Q. Convergence analysis of some algorithms for solving nonsmooth equations[J]. Mathematics of Operations Research, 1993, 18(1):227-244. [25] Qi L Q, Sun J. A nonsmooth version of Newton's method[J]. Mathematical Programming, 1993, 58:353-367. [26] Qi L Q, Sun D F, Zhou G L. A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities[J]. Mathematical Programming, 2000, 87:1-35. [27] Hladík M, Moosaei H. Some notes on the solvability conditions for absolute value equations[J]. Optimization Letters, 2022. https://doi.org/10.1007/s11590-022-01900-x. [28] Tang J Y, Zhou J C. Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem[J]. Computational Optimization and Applications, 2021, 80:213-244. [29] Tang J Y, Zhang H C. A nonmonotone smoothing Newton algorithm for weighted complementarity problem[J]. Journal of Optimization Theory and Applications, 2021, 189:679-715. [30] Wang A, Cao Y, Chen J X. Modified Newton-type iteration methods for generalized absolute value equations[J]. Journal of Optimization Theory and Applications, 2019, 181:216-230. [31] Yu D M, Chen C R, Han D R. A modified fixed point iteration method for solving the system of absolute value equations[J]. Optimization, 2022, 71(3):449-461. [32] Yu D M, Chen C R, Yang Y N, Han D R. An inertial inverse-free dynamical system for solving absolute value equations[J]. Journal of Industrial and Management Optimization, 2022. https://doi.org/10.3934/jimo.2022055. [33] Zhang H C, Hager W W. A nonmonotone line search technique and its application to unconstrained optimization[J]. SIAM Journal on Optimization, 2004, 14(4):1043-1056. [34] Zhang J L, Zhang G F, Liang Z Z. A modified generalized SOR-like method for solving an absolute value equation[J]. Linear and Multilinear Algebra, 2022. https://doi.org/10.1080/03081087.2022.2066614. [35] Zamani M, Hladík M. Error bounds and a condition number for the absolute value equations[J]. Mathematical Programming, 2022. https://doi.org/10.1007/s10107-021-01756-6. |
[1] | 孙青青, 王川龙. 低秩稀疏矩阵恢复的快速非单调交替极小化方法[J]. 计算数学, 2021, 43(4): 516-528. |
[2] | 郦旭东. 复合凸优化的快速邻近点算法[J]. 计算数学, 2020, 42(4): 385-404. |
[3] | 李枝枝, 柯艺芬, 储日升, 张怀. 二阶锥线性互补问题的广义模系矩阵分裂迭代算法[J]. 计算数学, 2019, 41(4): 395-405. |
[4] | 毕亚倩, 刘新为. 求解界约束优化的一种新的非单调谱投影梯度法[J]. 计算数学, 2013, 35(4): 419-430. |
[5] | 孙清滢, 段立宁, 陈颖梅, 王宣战, 宫恩龙, 徐胜来. 基于修正拟牛顿方程的两阶段步长非单调稀疏对角变尺度梯度投影算法[J]. 计算数学, 2013, 35(2): 113-124. |
[6] | 范斌, 马昌凤, 谢亚君. 求解非线性互补问题的一类光滑Broyden-like方法[J]. 计算数学, 2013, 35(2): 181-194. |
[7] | 万中, 冯冬冬. 一类非单调保守BFGS算法研究[J]. 计算数学, 2011, 33(4): 387-396. |
[8] | 庞善民, 陈兰平. 一类带非单调线搜索的信赖域算法[J]. 计算数学, 2011, 33(1): 48-56. |
[9] | 孙清滢, 崔彬, 王长钰. 新非单调线搜索规则的Lampariello修正对角稀疏拟牛顿算法[J]. 计算数学, 2008, 30(3): 255-268. |
阅读次数 | ||||||
全文 |
|
|||||
摘要 |
|
|||||