- Free Articles
-
Reactive Scheduling of Batch Processes
Encyclopedia of Optimization
-
Variational methods in shape analysis
Handbook of Mathematical Methods in Imaging
-
History of Geomathematics: Navigation on Sea
Handbook of Geomathematics
-
Geomagnetic Field: Satellite Data
Handbook of Geomathematics
-
From Omnipotent to Omnipresent Maps
Handbook of Geomathematics
- More Free Articles
Mathematics and Statistics
>
Encyclopedia of Optimization
>
Stochastic Quasigradient Methods
This is the free portion of the full article.
The full article
is available to licensed users only.
How do I get access?
Stochastic Quasigradient Methods
Article Outline
Keywords and Phrases
Introduction
Calculation of SQG
Convergence Properties
Nonsmooth Problems
Averaging Operations
General Constraints
References
Keywords and Phrases Stochastic quasigradient (SQG) methods - Stochastic quasigradients (SQG) - Nonstationary optimization - Generalized differentiable (GD) function - Stochastic approximation - Global optimization
Introduction
Traditional deterministic optimization methods are used for well defined objective and constraint functions, i. e., when it is possible to calculate exactly F0(x) to be minimized (or maximized) and to verify constraints
for each decision vector x = (x1,...,xn)∈X, where the set X has a "simple" structure (for example, defined by linear constraints). Usually it is also assumed that gradients or subgradients (for nonsmooth functions) Fix of the functions Fi,i = 0,1,...,m are easily calculated. Stochastic
![]() |
(1) |
