搜索结果: 1-5 共查到“coordinate descent”相关记录5条 . 查询时间(0.078 秒)
Regularization Paths for Cox’s Proportional Hazards Model via Coordinate Descent
survival Cox model lasso elastic net
2015/8/21
We introduce a pathwise algorithm for the Cox proportional hazards model, regularized by convex combinations of `1 and `2 penalties (elastic net). Our algorithm fits via cyclical coordinate descent, a...
SparseNet:Coordinate Descent with Non-Convex Penalties
Sparse Regression Regularization Surface Non-convex Optimization Coordinate Descent Degrees of Freedom Variable Selection LASSO
2015/8/21
We address the problem of sparse selection in linear models. A number of non-convex penalties have been proposed in the literature for this purpose, along with a variety of convex-relaxation algorithm...
On the Complexity Analysis of Randomized Block-Coordinate Descent Methods
Randomized block-coordinate descent accelerated coordinate descent iteration complexity convergence rate composite minimization
2013/6/17
In this paper we analyze the randomized block-coordinate descent (RBCD) methods proposed in [8,11] for minimizing the sum of a smooth convex function and a block-separable convex function. In particul...
Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function
Block coordinate descent iteration complexity composite minimization
2011/7/19
In this paper we develop a randomized block-coordinate descent method for minimizing the sum of a smooth and a simple nonsmooth block-separable convex function and prove that it obtains an $\epsilon$-...
Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function
Block coordinate descent iteration complexity composite minimization coordinate relaxation alternating minimization
2011/9/6
Abstract: In this paper we develop a randomized block-coordinate descent method for minimizing the sum of a smooth and a simple nonsmooth block-separable convex function and prove that it obtains an $...