求解非光滑方程组的三次正则化方法

doi:10.15960/j.cnki.issn.1007-6093.2019.02.002

运筹学学报 ›› 2019, Vol. 23 ›› Issue (2): 17-30.doi: 10.15960/j.cnki.issn.1007-6093.2019.02.002

求解非光滑方程组的三次正则化方法

苗小楠¹, 顾剑^2,*, 肖现涛¹

1. 大连理工大学数学科学学院, 辽宁大连 116024;
2. 大连海洋大学理学院, 辽宁大连 116024

收稿日期:2017-03-24 出版日期:2019-06-15 发布日期:2019-06-15
通讯作者: 顾剑 E-mail:gujian@dlou.edu.cn
基金资助:
国家自然科学基金（Nos.11871135，11801054）

A cubic regularization method for solving nonsmooth equations

MIAO Xiaonan¹, GU Jian^2,*, XIAO Xiantao¹

1. School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, Liaoning, China;
2. School of Sciences, Dalian Ocean University, Dalian 116024, Liaoning, China

Received:2017-03-24 Online:2019-06-15 Published:2019-06-15

摘要/Abstract

摘要： 考虑求解非光滑方程组的三次正则化方法及其收敛性分析.利用信赖域方法的技巧，保证该方法是全局收敛的.在子问题非精确求解和BD正则性条件成立的前提下，分析了非光滑三次正则化方法的局部收敛速度.最后，数值实验结果验证了该算法的有效性.

关键词: 三次正则化方法, 非光滑方程组, 局部收敛速度

Abstract: A cubic regularization method and its convergence for solving a nonsmooth system of equations are studied in this paper. By applying the classical trust region technique, the proposed method is ensured to be globally convergent. When BDregular condition is satisfied and the subproblem is inexactly solved, we analyze the local convergence rate of the nonsmooth cubic regularization method. Finally, the efficiency of our method is verified by numerical results.

Key words: cubic regularization method, nonsmooth equations, local convergence

中图分类号:

O221.2
O224

苗小楠, 顾剑, 肖现涛. 求解非光滑方程组的三次正则化方法[J]. 运筹学学报, 2019, 23(2): 17-30.

MIAO Xiaonan, GU Jian, XIAO Xiantao. A cubic regularization method for solving nonsmooth equations[J]. Operations Research Transactions, 2019, 23(2): 17-30.

参考文献 11

[1]	Pang J S, Qi L Q. Nonsmooth equations:motivation and algorithms[J]. SIAM Journal on Optimization, 1993, 3(3):443-465.
[2]	Qi L Q, Sun D F. A survey of some nonsmooth equations and smoothing Newton methods[M]//Progress in Optimization, New York:Springer, 1999.
[3]	Nesterov Y, Polyak B T. Cubic regularization of Newton's method and its global performance[J]. Mathematical Programming, 2006, 108(1):177-205.
[4]	Cartis C, Gould N I M, Toint P L. On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization[J]. SIAM Journal on Optimization, 2010, 20(6):2833-2852.
[5]	Cartis C, Gould N I M, Toint P L. Adaptive cubic regularisation methods for unconstrained optimization. Part I:motivation, convergence and numerical results[J]. Mathematical Programming, 2011, 127(2):245-295.
[6]	Cartis C, Gould N I M, Toint P L. Adaptive cubic overestimation methods for unconstrained optimization. Part Ⅱ:worst-case function-evaluation complexity[J]. Mathematical Programming, 2011, 130(2):295-319.
[7]	Qi L Q, Sun J. A nonsmooth version of Newton's method[J]. Mathematical Programming, 1993, 58(1):353-367.
[8]	Facchinei F, Pang J S. Finite-Dimensional Variational Inequalities and Complementarity Problems I[M]. New York:Springer-Verlag, 2003.
[9]	Facchinei F, Pang J S. Finite-Dimensional Variational Inequalities and Complementarity Problems Ⅱ[M]. New York:Springer-Verlag, 2003.
[10]	Lukšan L. Inexact trust region method for large sparse systems of nonlinear equations[J]. Journal of Optimization Theory and Applications, 1994, 81(3):569-590.
[11]	Qi L Y, Xiao X T, Zhang L W. A parameter-self-adjusting Levenberg-Marquardt method for solving nonsmooth equations[J]. Journal of Computational Mathematics, 2016, 34(3):317-338.

[1]	徐姿, 张慧灵. 非凸极小极大问题的优化算法与复杂度分析[J]. 运筹学学报, 2021, 25(3): 74-86.
[2]	柯荣住, 张进. 从双层规划的角度看道德风险理论的一阶条件方法[J]. 运筹学学报, 2021, 25(3): 87-104.
[3]	黎君, 陈加伟, 邓光菊. 广义凸区间值优化问题的最优性条件[J]. 运筹学学报, 2020, 24(4): 25-38.
[4]	赵丹, 高岳林. 非线性整数规划问题的无参数填充函数算法[J]. 运筹学学报, 2020, 24(4): 63-73.
[5]	潘少华, 文再文. 低秩稀疏矩阵优化问题的模型与算法[J]. 运筹学学报, 2020, 24(3): 1-26.
[6]	郭科, 王涛, 张有才. 广义黏性逼近方法及其应用[J]. 运筹学学报, 2020, 24(3): 127-140.
[7]	陶杰, 高岩. 疫情环境下价格导向的防护物资最优生产分配机制研究[J]. 运筹学学报, 2020, 24(1): 13-22.
[8]	陈永, 王薇, 徐以汎. 具有间断扩散性质的线性约束全局优化随机算法[J]. 运筹学学报, 2020, 24(1): 88-100.
[9]	黎超琼, 李锋. 一种求解单调变分不等式的部分并行分裂LQP交替方向法[J]. 运筹学学报, 2020, 24(1): 101-114.
[10]	郭田德, 韩丛英. 从数值最优化方法到学习最优化方法[J]. 运筹学学报, 2019, 23(4): 1-12.
[11]	梁仁莉, 白延琴. 求解稀疏逻辑回归问题的嵌套BB算法的分裂增广拉格朗日算法[J]. 运筹学学报, 2019, 23(2): 86-94.
[12]	唐莉萍, 杨新民. 两类锥广义伪不变凸性的刻画[J]. 运筹学学报, 2015, 19(1): 1-8.
[13]	曾友芳, 唐春明. 二阶锥规划一个超线性收敛的非内部连续化算法[J]. 运筹学学报, 2015, 19(1): 18-30.
[14]	刘水霞, 陈国庆. 求解互补约束优化问题的乘子松弛法[J]. 运筹学学报, 2014, 18(4): 119-130.
[15]	杨赟, 彭拯. 可分离凸优化问题的非精确平行分裂算法[J]. 运筹学学报, 2014, 18(3): 33-46.

求解非光滑方程组的三次正则化方法

A cubic regularization method for solving nonsmooth equations

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献 11

相关文章 15

编辑推荐

Metrics

本文评价