Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SVMlight / rank | |||
Normal rank | |||
Revision as of 00:48, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization |
scientific article |
Statements
Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (English)
0 references
5 May 2009
0 references
support vector machines
0 references
bilevel optimization
0 references
\(\ell_{1}\)-regularization
0 references
global convergence
0 references
linear convergence rate
0 references
complexity bound
0 references
