Steepest Descent Method with Random Step Lengths

Simple item page
dc.contributor.authorKalousek Zdeněkcs
dc.date.accessioned2020-06-08T09:41:41Z
dc.date.available29-54-2019en
dc.date.available2020-06-08T09:41:41Z
dc.date.issued2017cs
dc.date.updated29-55-2019en
dc.format.extent64cs
dc.identifier.doi10.1007/s10208-015-9290-8
dc.identifier.issn1615-3375cs
dc.identifier.urihttps://dspace.tul.cz/handle/15240/155815
dc.language.isoengcs
dc.publisherSpringercs
dc.relation.ispartofFoundations of Computational Mathematicsen
dc.relation.ispartofseries0cs
dc.relation.urihttps://link.springer.com/article/10.1007/s10208-015-9290-8cs
dc.riv.kontrolni-cislo192065445cs
dc.riv.specifikaceRIV/46747885:24510/17:00006440!RIV19-MSM-24510___cs
dc.subjectOptimizationcs
dc.subjectGradient methodscs
dc.subjectStochastic processcs
dc.subjectAlgorithmscs
dc.subjectConvergencecs
dc.subjectComputational experimentscs
dc.titleSteepest Descent Method with Random Step Lengthscs
local.citation.epage359-422cs
local.citation.spage359-422cs
local.identifier.publikace6440
local.identifier.wok398888500002en
local.relation.issue2cs
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Kalousek__Steepest_Descent_Method_with_Random_Step_Lengths.pdf
Size:
2.45 MB
Format:
Adobe Portable Document Format
Description:
publikace
Download
Collections