Block-Coordinate Gradient Descent method
We consider the problem of minimizing the weighted sum of a smooth function f and a convex function P of n real variables subject to m linear equality constraints. We propose a block-coordinate gradient descent method for solving this problem, with the coordinate block chosen by a Gauss-Southwell-q rule based on sufficient predicted descent. We establish global convergence to first-order stationarity for this method and, under a local error bound assumption, linear rate of convergence. If f is convex with Lipschitz continuous gradient, then the method terminates in O(n2/) iterations with an -optimal solution. If P is separable, then the Gauss- Southwell-q rule is implementable in O(n) operations when m = 1 and in O(n2) operations when m>1. In the special case of support vector machines training, for which f is convex quadratic, P is separable, and m = 1,
- snowwhitexiang2014-02-27文章确实很经典,非常值得看
- moshe_tianxing2014-05-20文章很经典,帮助很大
- lf2008064102562014-05-14很好!我正需要。
- 胡秀韬2018-06-18有用,个人感觉很好。
- broken33333hf2013-08-14文章很经典,推荐下载
- 粉丝: 9
- 资源: 25
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助