On convergence and complexity analysis of an accelerated forward-backward algorithm with linesearch technique for convex minimization problems and applications to data prediction and classification (Q2072932): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1186/s13660-021-02675-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3195018806 / rank | |||
Normal rank | |||
Revision as of 18:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On convergence and complexity analysis of an accelerated forward-backward algorithm with linesearch technique for convex minimization problems and applications to data prediction and classification |
scientific article |
Statements
On convergence and complexity analysis of an accelerated forward-backward algorithm with linesearch technique for convex minimization problems and applications to data prediction and classification (English)
0 references
26 January 2022
0 references
convex minimization problems
0 references
machine learning
0 references
forward-backward algorithm
0 references
linesearch
0 references
accelerated algorithm
0 references
data classification
0 references
