Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5550745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization |
scientific article; zbMATH DE number 5550745 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8708902597427368
0 references
0.8534010648727417
0 references
0.8450190424919128
0 references
0.8314935564994812
0 references
