摘要
文章旨在研究一类不确定支持向量机问题的鲁棒可行性.首先借助鲁棒优化方法,引入该不确定支持向量机问题的鲁棒对等问题.随后给出鲁棒对等问题的重构优化问题.最后借助该重构问题和上图集,得到该不确定支持向量机问题的鲁棒可行性半径的精确计算公式.
This paper is concerned with the robust feasibility for a class of support vector machine problems with uncertain data.Firstly,a robust counterpart problem of the uncertain support vector machine problem is introduced in terms of robust optimization.Then,a reformulation of the robust counterpart problem of the uncertain support vector machine problem is given.Finally,by using this reformulation and the so-called epigraphical set,an exact formula for the radius of robust feasibility of the uncertain support vector machine problem is obtained.
作者
肖彩云
孙祥凯
XIAO Caiyun;SUN Xiangkai(School of Mathematics and Statistics,Chongqing Technology and Business University,Chongqing 400067)
出处
《系统科学与数学》
CSCD
北大核心
2024年第1期260-268,共9页
Journal of Systems Science and Mathematical Sciences
基金
国家自然科学基金(12001070)
重庆市自然科学基金面上项目(cstc2020jcyjmsxmX0061)
重庆市教委科技项目重点项目(KJZD-K202200803)资助课题.
关键词
支持向量机问题
鲁棒优化
鲁棒可行性
Support vector machine problem
robust optimization
robust feasibility