On Choosing Parameters in Retrospective-Approximation Algorithms for Stochastic Root Finding and Simulation Optimization
type: Item
instance of: scholarly article
title: On Choosing Parameters in Retrospective-Approximation Algorithms for Stochastic Root Finding and Simulation Optimization
zbMATH Open document ID: 1228.90069
author: Raghu Pasupathy
published in: Operations Research
publication date: 2011-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90B20
zbMATH DE Number: 5973529
zbMATH Keywords: design of experiments
MaRDI profile type: Publication
OpenAlex ID: W2026272724
DOI: 10.1287/OPRE.1090.0773
Recommended article: Retrospective-approximation algorithms for the multidimensional stochastic root-finding problem
Recommended article: The stochastic root-finding problem
Recommended article: Stochastic recursive algorithms for optimization. Simultaneous perturbation methods
Recommended article: Stochastic approximation algorithms for constrained optimization via simulation
Recommended article: On the Choice of Random Directions for Stochastic Approximation Algorithms
Recommended article: Optimum parameters and nonasymptotic bounds on the rate of convergence of stochastic algorithms in criterial optimization problems
Recommended article: Q3585651
Recommended article: A Stochastic Approximation Framework for a Class of Randomized Optimization Algorithms
Recommended article: Q4037207
Recommended article: Q3341781
description: scientific article