Stochastic Bigger Subspace Algorithms for Nonconvex Stochastic Optimization

It is well known that the stochastic optimization problem can be regarded as one of the most hard problems since, in most of the cases, the values of f and its gradient are often not easily to be solved, or the F(∙, ξ) is normally not given clearly and (or) the distribution function P is equivocal....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE access Jg. 9; S. 1
Hauptverfasser:	Yuan, Gonglin, Zhou, Yingjie, Wang, Liping, Yang, Qingyuan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 01.01.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Approximation algorithms Complexity Complexity analysis Complexity theory Convergence Convergence property Distribution functions Machine learning Machine learning algorithms Nonconvex function Optimization Quasi Newton methods Random variables Stochastic processes Stochastic subspace algorithm
ISSN:	2169-3536, 2169-3536
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!