{'fraction_non_alphanumeric': 0.016129032258064516, 'fraction_numerical': 0.0, 'mean_word_length': 5.719745222929936, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
STOCHASTIC OPTIMIZATION FOR SYSTEM DESIGN

ABSTRACT Optimization problems occur in system designs with simulation applications. The decision variables are controllable system parameters of interest and the objective function is a system performance measure that can be estimated via simulation experiments. Using the estimates of objective function values to find the optimal point is called the stochastic optimization problem. The literature of such problems focuses on stochastic approximation. Despite its convergence proof, stochastic approximation may converge slowly if the algorithm parameter values are not well chosen. For practical uses, good algorithms should provide real-time solutions besides guaranteeing convergence. We propose the FDRA algorithm assuming that the objective function is differentiable. FDRA uses the RA-Broyden's algorithm to find the zero of the gradient function, where gradients are estimated by the finite-difference method. In our empirical results, FDRA converges quickly and is robust to its algorithm parameters.