吉林大学学报(理学版) ›› 2019, Vol. 57 ›› Issue (2): 258-264.

• 数学 • 上一篇    下一篇

线性圆锥互补问题的光滑化牛顿法

张所滨1,2, 汪洋2,3, 迟晓妮3,4, 曾祥艳3,5
  

  1. 1. 桂林电子科技大学 计算机与信息安全学院, 广西 桂林 541004; 2. 桂林电子科技大学 广西密码学与信息安全重点实验室, 广西 桂林 541004; 3. 桂林电子科技大学 数学与计算科学学院, 广西 桂林 541004;4. 桂林电子科技大学 广西高校数据分析与计算重点实验室, 广西 桂林 541004; 5. 桂林电子科技大学 广西自动检测技术与仪器重点实验室, 广西 桂林 541004
  • 收稿日期:2018-04-18 出版日期:2019-03-26 发布日期:2019-03-26
  • 通讯作者: 迟晓妮 E-mail:chixiaoni@126.com

Smoothing Newton Method for Linear CircularCone Complementarity Problems#br#

ZHANG Suobin1,2, WANG Yang2,3, CHI Xiaoni3,4, ZENG Xiangyan3,5#br#   

  1. 1. School of Computer Science and Information Security,  Guilin University of Electronic Technology, Guilin 541004, Guangxi Zhuang Autonomous Region, China; 2. Guangxi Key Laboratory of Cryptography and Information Security,Guilin University of Electronic Technology, Guilin 541004, Guangxi Zhuang Autonomous Region, China;3. School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004, Guangxi Zhuang Autonomous Region, China; 4. Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, Guilin University of Electronic Technology, Guilin 541004, Guangxi Zhuang Autonomous Region, China; 5. Guangxi Key Laboratory of Automatic Detection Technology and Instrument, Guilin University of Electronic Technology, Guilin 541004, Guangxi Zhuang Autonomous Region, China
  • Received:2018-04-18 Online:2019-03-26 Published:2019-03-26
  • Contact: CHI Xiaoni E-mail:chixiaoni@126.com

摘要: 给出求解线性圆锥互补问题一种新的光滑化牛顿法. 首先, 基于一个圆锥互补函数的光滑化函数, 将线性圆锥互补问题转化成一个方程组,
 然后用光滑化牛顿法求解该方程组; 其次, 在适当假设下, 证明该算法具有全局收敛性和局部二阶收敛性. 数值结果表明, 该算法求解线性圆锥互补问题所需的CPU时间和迭代次数均较少, 且相对稳定, 从而证明了算法的有效性.

关键词: 线性圆锥互补问题, 光滑化牛顿法, 光滑化函数, 全局收敛,  , 局部二阶收敛

Abstract: We presented a new smoothing Newton method for solving the linear circular cone complementarity problems. Firstly, based on  the smoothing function of the circular cone complementary function, the linear circular cone complementarity problem was transformed into a system of equations, which were solved by the smoothing Newton method. Secondly, under suitable assumptions, we proved that the algorithm had the global convergence and local quadratic convergence. The numerical results show that the CPU time and iteration times of the algorithm for solving linear circular cone complementarity problems are less, and the algorithm is relatively stable, which proves the effectiveness of the algorithm.

Key words: linear circular cone complementarity problem, smoothing Newton method, smoothing function, global convergence, local quadratic convergence

中图分类号: 

  • O221