期刊文献+

随机Bregman ADMM及其在训练具有离散结构的支持向量机中的应用

A stochastic Bregman ADMM with its application in training sparse structure SVMs
下载PDF
导出
摘要 针对具有多块可分结构的非凸优化问题提出了一类新的随机Bregman交替方向乘子法,在周期更新规则下,证明了该算法的渐进收敛性;在随机更新的规则下,几乎确定的渐进收敛性得以证明。数值实验结果表明,该算法可有效训练具有离散结构的支持向量机。 A new stochastic Bregman multiplier alternating direction method(SB-ADMM)is proposed for non-convex optimization problems with multiple separable blocks.It is shown that the sequence produced by the S-B-ADMM under the periodic update rule converges asymptotically to a stationary solution of the Lagrangian function of the original problem.Under the random update rule,we prove the almost surely convergence of the sequence produced by the S-B-ADMM.Numerical experiments results illustrate the feasibility of the S-B-ADMM for training sparse structural support vector machines.
作者 吕袈豪 罗洪林 杨泽华 彭建文 LYU Jiahao;LUO Honglin;YANG Zehua;PENG Jianwen(School of Mathematical Sciences,Chongqing Normal University,Chongqing 401331,China;School of Computer and Information Science,Chongqing Normal University,Chongqing 401331,China)
出处 《运筹学学报》 CSCD 北大核心 2022年第2期16-30,共15页 Operations Research Transactions
基金 国家自然科学基金(Nos.11991024,11771064) 重庆市高校创新研究群体项目(No.CXQT20014) 重庆市创新领军人才项目团队(No.CQYC20210309536) 重庆市科技局(No.cstc2021jcyjmsx300)。
关键词 多块可分离的非凸优化问题 Bregman度量 随机交替方向乘子法 渐进收敛性 支持向量机 non-convex optimization problems with multiple separable blocks Bregman divergence stochastic ADMM asymptotic convergence support vector machine
  • 相关文献

参考文献5

二级参考文献43

  • 1郑宏,葛修润.节理岩体的变分不等式模型[J].中国科学(B辑),1995,25(9):986-993. 被引量:4
  • 2Berry M W,Browne M,Langville A N,Pauca V P Plemmons R J. Algorithms andapplications for approximate nonnegative matrix factorization[J].Computational Statistics and Data Analysis,2007,(01):155-173.
  • 3Bertsekas D P,Tsitsiklis J N. Parallel and Distributed Computation: Numerical Methods[M].Upper Saddle River:Prentice-Hall,Inc,1989.
  • 4Biswas P,Lian T C,Wang T C,Ye Y. Semidefinite programming based algorithms for sensor network (l)ocalization[J].ACM Transactions on Sensor Networks,2006,(02):188-220.
  • 5Cai J F,Candes E J,Shen Z. A singular value thresholding algorithm for matrix completion export[J].SIAM Journal on Optimization,2010.1956-1982.
  • 6Candès E J,Li X,Ma Y,Wright J. Robust principal component analysis[J].Journal of the ACM,2011,(03):11.
  • 7Candès E J,Recht B. Exact matrix completion via convex optimization[J].Foundations of Computational Mathematics,2009,(06):717-772.doi:10.1007/s10208-009-9045-5.
  • 8Candès E J,Tao T. The power of convex relaxation:Near-optimal matrix completion[J].IEEE Transactions on Information theory,2010,(05):2053-2080.
  • 9Cichocki A,Morup M,Smaragdis P,Wang W,Zdunek R. Advances in Nonnegative Matrix and Tensor Factorization[A].New York:Hindawi Publishing Corporation,2008.
  • 10Cichocki A,Zdunek R,Phan A H,Amari S. Nonnegative Matrix and Tensor Factorizations—Applications to Exploratory Multiway Data Analysis and Blind Source Separation[M].Hoboken:John Wiley & Sons,Ltd,2009.

共引文献40

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部