On Linear Convergence of a Class of Random Search Algorithms (Q3824116): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/zamm.19890690119 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005045813 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4077092 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3036154 / rank | |||
Normal rank | |||
Latest revision as of 15:11, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Linear Convergence of a Class of Random Search Algorithms |
scientific article |
Statements
On Linear Convergence of a Class of Random Search Algorithms (English)
0 references
1989
0 references
random search algorithms
0 references
gradient algorithm
0 references
linear convergence rate
0 references
stochastic algorithms
0 references
