摘要
考虑R;空间中的最小包容球问题,提出一类光滑逼近算法.此外,给出数值实验结果,表明本文的算法比Pan等(Applied Mathematics and Computation,2006,172(1):49-61.)的算法更有效.
In this paper, the smallest enclosing ball problem is considered in R;space, and a class of smooth approximation algorithm is given. Furthermore, numerical experiment results are given, which shows that the algorithm in this paper is more efficient than that usedinthe Pan et al(Applied Mathematics and Computation, 2006,172(1):49-61.).
作者
李尧
蒋毅
柏雪婷
LI Yao;JIANG Yi;BAI Xueting(School of Mathematical Sciences,Sichuan Normal University,Chengdu 610066,Sichuan;Key Laboratory of Visual Computing and Virtual Reality,Sichuan Normal University,Chengdu 610066,Sichuan)
出处
《四川师范大学学报（自然科学版）》
CAS
2022年第1期48-53,共6页
Journal of Sichuan Normal University（Natural Science）
基金
国家自然科学基金(11201324)
教育部霍英东基金(141114)。
关键词
最小包容球
极大极小问题
非光滑优化
光滑逼近
SEB problems
minimax problems
nonsmooth optimization
smooth approximation
