Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"finite-time performance"”.
-
Assessing the Finite-Time Performance of Local Search Algorithms
… process of choosing parameters to improve their performance difficult. This dissertation introduces the B-acceptable solution probability in terms of B-acceptable solutions as a finite-time performance measure for local search algorithms. The B-acceptable solution probability reflects how …
-
Generalized hill climbing algorithms for discrete optimization problems
… that exist between the GHC algorithm's finite-time performance on three problems, and the general random variable formulations used. The dissertation concludes with suggestions for further research.
-
Optimal computing budget allocation for multi-objective simulation optimization
… common in real world situations and multiple performance measures are usually of interest. Simulation has been widely employed in evaluating these systems and selecting the desired ones. Performances of these systems are frequently stochastic in nature and therefore selection based on …
-
Sampling Controlled Stochastic Recursions: Applications to Simulation Optimization and Stochastic Root Finding
… but most such theory focuses on asymptotic performance. Automatically choosing parameters to ensure good finite-time performance has remained vexingly elusive, as evidenced by continuing efforts six decades after the introduction of stochastic approximation! The other popular paradigm to …
-
Adaptive sampling trust-region methods for derivative-based and derivative-free simulation optimization problems
… a first-order critical point with good practical performance. In the second study the Monte Carlo simulation is assumed to provide no direct observations of the function gradient. We present ASTRO-DF, which is a class of derivative-free trust-region algorithms, where the stochastic local model is …
-
The exploration-exploitation trade-off in sequential decision making problems
… decision making problems, in terms of maximising finite-time reward. The most common and best studied abstraction of the exploration-exploitation trade-off is the classic multi-armed bandit problem. In this thesis we study several important extensions that are more suitable than the classic …
-
Stochastically Constrained Simulation Optimization On Mixed-Integer Spaces
… and the constraints are expressed in terms of performance measures of the system that are observable only via a simulation model parameterized by a finite number of decision variables. In solving for such a system, one faces the much harder challenge of verifying the feasibility of a potential …
-
Stochastic Simulation: New Stochastic Approximation Methods and Sensitivity Analyses
… which is a convex combination of a symmetric finite difference-type gradient estimate and an average of two associated direct gradient estimates. We derive variance minimizing weights that lead to desirable theoretical properties and prove convergence of the SA algorithms. Next, we study the …
-
Online advertisements and multi-armed bandits
… limitations and achievable results for the performance of multi-armed bandit algorithms. We then formulate variations of the basic stochastic multi-armed bandit problem, aimed at modeling how budget-limited advertisers should bid and how ad exchanges should choose whose ad to display, and …