2026-09-18T19:51:24Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/45385 2023-07-11 col_2142_5131 col_2142_16359 com_2142_5130 com_2142_16358 com_2142_234

Nedich, Angelia Shanbhag, Vinayak V. Nedich, Angelia Shanbhag, Vinayak V. Srikant, Rayadurgam Zhou, Enlu Yousefian, Seyed Farzad 2013-08-22T16:38:34Z 2013-08-22T16:38:34Z 2013-08 2013-08-22T16:38:34Z 2013-08 Stochastic approximation (SA) methods, first proposed by Robbins and Monro in 1951 for root- finding problems, have been widely used in the literature to solve problems arising from stochastic convex optimization, stochastic Nash games and more recently stochastic variational inequalities. Several challenges arise in the development of SA schemes. First, little guidance is provided on the choice of the steplength sequence. Second, most variants of these schemes in optimization require differentiability of the objective function and Lipschitz continuity of the gradient. Finally, strong convexity of the objective function is another requirement that is a strong assumption to hold. Motivated by these challenges, this thesis focuses on studying research challenges related to the SA methods in three different areas: (i) steplengths, (ii) smoothing, and (iii) regularization. The first part of this thesis pertains to solving strongly convex differentiable stochastic optimization problems using SA methods. The performance of standard SA implementations can vary significantly based on the choice of the steplength sequence, and in general, little guidance is provided about good choices. Motivated by this gap, we present two adaptive steplength schemes equipped with convergence theory that aim to overcome some of the reliance on user-specefi c parameters. Of these, the first scheme, referred to as a recursive steplength stochastic approximation (RSA) scheme, minimizes the error bounds to derive a rule that expresses the steplength at a given iteration as a simple function of the steplength at the previous iteration and certain problem parameters. The second scheme, termed as a cascading steplength stochastic approximation (CSA) scheme, maintains the steplength sequence as a piecewise-constant decreasing function with the reduction in the steplength occurring when a suitable error threshold is met. We then allow for nondiff erentiable objectives but with bounded subgradients over a certain domain. In such a regime, we propose a local smoothing technique, based on random local perturbations of the objective function that leads to a differentiable approximation of the function and a Lipschitzian property for the gradient of the approximation. This facilitates the development of an adaptive steplength stochastic approximation framework, which now requires sampling in the product space of the original measure and the artifi cally introduced distribution. Motivated by problems arising in decentralized control problems and non-cooperative Nash games, in the second part of this thesis, we consider a class of strongly monotone Cartesian variational inequality problems, where the mappings either contain expectations or their evaluations are corrupted by error. Such complications are captured under the umbrella of Cartesian stochastic variational inequality (CSVI) problems and we consider solving such problems via SA schemes. Spece fically, along similar directions to the RSA scheme, a stepsize rule is constructed for strongly monotone stochastic variational inequality problems. The proposed scheme is seen to produce sequences that are guaranteed to converge almost surely to the unique solution of the problem. To cope with networked multi-agent generalizations, we provide requirements under which independently chosen steplength rules still possess desirable almost-sure convergence properties. To address non-smoothness, we consider a regime where Lipschitz constants on the map are either unavailable or di fficult to derive. Here, we generalize the aforementioned smoothing scheme for deriving an approximation of the original mapping, which is then shown to be Lipschitz continuous with a prescribed constant. Using this technique, we introduce a locally randomized SA algorithm and provide almost sure convergence theory for the resulting sequence of iterates to an approximate solution of the original CSVI problem. In the third part of this thesis, we consider a stochastic variational inequality (SVI) problem with a continuous and monotone mapping over a compact and convex set. Traditionally, stochastic approximation schemes for SVIs have relied on strong monotonicity and Lipschitzian properties of the underlying map. We present a regularized smoothed SA (RSSA) scheme wherein stepsize, smoothing, and regularization parameters are updated after every iteration. Under suitable assumptions on the sequences, we show that the algorithm generates iterates that converge to a solution the SVI problem in an almost-sure sense. Additionally, we provide rate estimates that relate iterates to their counterparts derived from the Tikhonov trajectory associated with a deterministic problem. Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-07-12T17:43:31Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Yousefian_Seyed Farzad.pdf: 2917761 bytes, checksum: 9f0742a5df5f02e27406bb4a39e753b3 (MD5) Made available in DSpace on 2013-08-22T16:38:34Z (GMT). No. of bitstreams: 2 Seyed Farzad_Yousefian.pdf: 2749924 bytes, checksum: fd8c041edf20b7b6d2dc746128bc573f (MD5) license.txt: 4072 bytes, checksum: 1ada8fcaac5476b47a53dbf2cc01efce (MD5) http://hdl.handle.net/2142/45385 en Copyright 2013 Seyed Farzad Yousefian Stochastic approximation methods Stochastic optimization Stochastic variational inequalities Game theory Stochastic approximation schemes for stochastic optimization and variational problems: adaptive steplengths, smoothing, and regularization text Industrial&Enterprise Sys Eng 1422 Industrial Engineering 0127 University of Illinois at Urbana-Champaign Dissertation Ph.D. PHD:Industrial Enginerng -UIUC 10KS0127PHD