Stochastic optimization (SO) are optimization methods that generate and use random variables. For stochastic optimization problems, the objective functions...
12 KB (1,071 words) - 06:25, 15 December 2024
or subdifferentiable). It can be regarded as a stochastic approximation of gradient descent optimization, since it replaces the actual gradient (calculated...
53 KB (7,031 words) - 19:45, 12 July 2025
Stochastic approximation methods are a family of iterative methods typically used for root-finding problems or for optimization problems. The recursive...
28 KB (4,388 words) - 08:32, 27 January 2025
generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from...
53 KB (6,165 words) - 15:32, 2 August 2025
mathematical optimization, stochastic programming is a framework for modeling optimization problems that involve uncertainty. A stochastic program is an...
35 KB (6,069 words) - 18:14, 27 June 2025
In numerical analysis, stochastic tunneling (STUN) is an approach to global optimization based on the Monte Carlo method-sampling of the function to be...
5 KB (552 words) - 11:58, 26 June 2024
Random optimization (RO) is a family of numerical optimization methods that do not require the gradient of the optimization problem and RO can hence be...
5 KB (613 words) - 07:37, 12 June 2025
Bayesian optimization is a sequential design strategy for global optimization of black-box functions, that does not assume any functional forms. It is...
21 KB (2,323 words) - 14:01, 8 June 2025
neural networks, stochastic optimization, genetic algorithms, and genetic programming. A problem itself may be stochastic as well, as in planning under...
29 KB (3,412 words) - 11:06, 16 April 2025
is an iterative optimization algorithm which uses minibatching to create a stochastic gradient estimator, as used in SGD to optimize a differentiable...
9 KB (1,370 words) - 15:18, 4 October 2024
deterministic and stochastic global optimization methods A. Neumaier’s page on Global Optimization Introduction to global optimization by L. Liberti Free...
18 KB (2,097 words) - 03:46, 26 June 2025
Robust optimization is a field of mathematical optimization theory that deals with optimization problems in which a certain measure of robustness is sought...
24 KB (3,410 words) - 13:45, 26 May 2025
optimization models can be either deterministic—with every set of variable states uniquely determined by the parameters in the model – or stochastic—with...
13 KB (1,559 words) - 11:30, 5 February 2025
Online machine learning (redirect from Incremental stochastic gradient descent)
a special case of stochastic optimization, a well known problem in optimization. In practice, one can perform multiple stochastic gradient passes (also...
25 KB (4,747 words) - 08:00, 11 December 2024
Reparameterization trick (category Stochastic optimization)
autoencoders, and stochastic optimization. It allows for the efficient computation of gradients through random variables, enabling the optimization of parametric...
11 KB (1,706 words) - 13:19, 6 March 2025
stochastic dynamic programming is a technique for modelling and solving problems of decision making under uncertainty. Closely related to stochastic programming...
23 KB (5,376 words) - 19:42, 21 March 2025
Augmented Lagrangian method (category Optimization algorithms and methods)
solving constrained optimization problems. They have similarities to penalty methods in that they replace a constrained optimization problem by a series...
15 KB (1,940 words) - 06:08, 22 April 2025
population-based trial and error problem solvers with a metaheuristic or stochastic optimization character. In evolutionary computation, an initial set of candidate...
27 KB (2,970 words) - 07:44, 17 July 2025
form of stochastic optimization, so that the solution found is dependent on the set of random variables generated. In combinatorial optimization, there...
48 KB (4,646 words) - 00:34, 24 June 2025
possible. Local search is a sub-field of: Metaheuristics Stochastic optimization Optimization Fields within local search include: Hill climbing Simulated...
9 KB (1,091 words) - 08:13, 28 July 2025
CMA-ES (category Stochastic optimization)
strategy for numerical optimization. Evolution strategies (ES) are stochastic, derivative-free methods for numerical optimization of non-linear or non-convex...
46 KB (7,561 words) - 12:37, 28 July 2025
algorithm. As an optimization method, it is appropriately suited to large-scale population models, adaptive modeling, simulation optimization, and atmospheric...
9 KB (1,555 words) - 21:05, 24 May 2025
Gradient descent (redirect from Gradient descent optimization)
Kingma, Diederik P.; Ba, Jimmy (2017-01-29), Adam: A Method for Stochastic Optimization, arXiv:1412.6980 Xie, Zeke; Yuan, Li; Zhu, Zhanxing; Sugiyama,...
39 KB (5,600 words) - 19:08, 15 July 2025
by using another overlaying optimizer, a concept known as meta-optimization, or even fine-tuned during the optimization, e.g., by means of fuzzy logic...
49 KB (5,222 words) - 13:05, 13 July 2025
Derivative-free optimization (sometimes referred to as blackbox optimization) is a discipline in mathematical optimization that does not use derivative...
5 KB (583 words) - 06:10, 20 April 2024
Multi-armed bandit (category Stochastic optimization)
Continuum-Armed Bandit Problem. SIAM J. of Control and Optimization. 1995. Besbes, O.; Gur, Y.; Zeevi, A. Stochastic multi-armed-bandit problem with non-stationary...
67 KB (7,668 words) - 23:00, 30 July 2025
also published several books, including Online Stochastic Combinatorial Optimization, Hybrid Optimization, and Constraint-Based Local Search. Van Hentenryck...
8 KB (759 words) - 23:54, 27 May 2024
13 (4), pp 387-401. Perez, Meir and Marwala, Tshilidzi (2008) Stochastic Optimization Approaches for Solving Sudoku arXiv:0805.0697. Lewis, R. A Guide...
15 KB (1,945 words) - 08:11, 28 February 2025
approach or scenario optimization approach is a technique for obtaining solutions to robust optimization and chance-constrained optimization problems based...
10 KB (1,258 words) - 19:17, 23 November 2023
Bellman equation (redirect from Intertemporal optimization)
programming equation (DPE) associated with discrete-time optimization problems. In continuous-time optimization problems, the analogous equation is a partial differential...
28 KB (4,010 words) - 16:35, 2 August 2025