优化算法笔记1

interior point

block coordinate relaxation

Boltzmann machine

求解L1范数最小化

  1. E. Candes, M. B. Wakin, and S. P. Boyd, “Enhancing sparsity by reweighted l1 minimization,” Journalof Fourier Analysis and Applications, vol. 14, pp. 877-905, Dec. 2008.
  2. I. Daubechies, M. Defriese, and C. DeMol, “An iterative thresholding algorithm for linear inverseproblems with a sparsity constraint,” Commun. Pure Appl. Math., vol.57, pp.1413-1457, 2004.(Interative Shrinkage algorithm)
加速算法
  1. G. Narkiss and M. Zibulevsky, “Sequential subspace optimization method for large-scale unconstrainedoptimization,” Technical Report CCIT No. 559, Technion, Israel Institute of Technology, Haifa, 2005.
  2. A. Beck and M. Teboulle, “A fast iterative shrinkage thresholding algorithm for linear inverseproblems,” SIAM J. Imaging Sciences, vol. 2, no. 1:183202, 2009.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值