2026-09-20T17:08:31Z https://www.ideals.illinois.edu/oai-pmh

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

Nedich, Angelia Nedich, Angelia Beck, Carolyn L. Stipanović, Dušan M. Voulgaris, Petros G. Tursun, Umit Deniz 2013-08-22T16:38:27Z 2013-08-22T16:38:27Z 2013-08 10000-01-01 2013-08-22T16:38:27Z 2013-08 The first focus of this thesis is to solve a stochastic convex minimization problem over an arbitrary family of nonempty, closed and convex sets. The problem has random features. Gradient or subgradient of objective function carries stochastic errors. Number of constraint sets can be extensive or infinitely many. Constraint sets might not be known apriori yet revealed through random realizations or randomly chosen from a collection of constraint sets throughout the horizon as in online learning concept. The traditional projection algorithms for solving minimization problems require projecting over complete collection of constraints at once or over a subset of them based on a predefined selection rule. But in practical applications either all of the constraints might not be known apriori or even if they are known projecting on the intersection set might be computationally prohibitive. We propose a two step gradient/subgradient iterative method with random projections. As the first step, a random gradient /subgradient projection is performed before observing the random constraint set realization. After taking random gradient /subgradient projection step we reach an intermittent point, which we obtained without considering the feasibility violation. Once the set realization is revealed or chosen within collection of constraint sets, the feasibility violation of intermittent point is corrected. We showed that projecting onto a random subcollection of them using our algorithm with diminishing stepsize is sufficient to converge to the solution set almost surely. Also the convergence of the algorithm for constant and nondiminishing nonsummable stepsizes are proved within an error bound. As the first set of experiments we tested the performance of the algorithm over a dynamic control system. We study three versions of the problem with correlated unknown-but-bounded additive noise, uncorrelated unknown-but-bounded additive noise and uncorrelated bounded output and peak input additive noise under fully known system description cases. It is essentially a robust least squares estimation problem where we recover state parameters from corrupted input and output data. We reformulated the linear least squares estimation problem as a stochastic convex minimization problem and then used the two step random projection algorithm to solve it. Although the problem has infinite number of constraints due to each realization of error term within bounded set, the algorithm goes through a finite subset of them and converges to the solution set. We also prove the existence of solution and provide equivalent minimization formulations or upper bound for these three types of robust least squares problems. We used standard subgradient algorithm to gauge the performance of our method. The implementation results are comparable to the ones found in literature. Our next focus is to solve a stochastic convex feasibility problem. We explored an algorithmic approach to solve both consistent and inconsistent convex feasibility problems for closed convex uncertain sets. We concentrated our attention on uncertain nature of sets and finding a feasible point using a random subcollection of them. The sets we consider might carry uncertainty due to inaccurate or imprecise spatial, spectral, stochastic information and confidence levels. For this objective we consider a stochastic optimization problem of minimizing an expected weighted proximity function over a collection of closed, convex sets. We show that the proposed algorithm converges to a point in the solution set when solution set is nonempty. In case of inconsistent feasibility problem i.e. the intersection of closed convex constraint sets being empty the algorithm minimizes the proximity function. The projection onto a subcollection of sets approach can be viewed as somewhere between random implementation of alternating projection method and parallel projection method. But our method is not deterministic. It uses random projections onto sets that carry additive bounded noise. Each realization within the bounded disturbances has equal chance of occurence. The conventional approach of set theoretic estimation problems provide solution that confirm with constraint sets known a priori or observed. But it fails to take into account that sets built on a priori or observed data may carry disturbances or have erroneously predicted statistical information, which may result in inconsistent sets. The attributes of original signal such as amplitude bound, region of support, band-limitedness that are used to built sets in estimation problems may not be accurate. Additionally sets that are built using moments, spectral properties, distribution and bounds information are based on predicted stochastic estimations. The overly conservative confidence bounds or statistical assumptions may cause inconsistencies. Also noise pertubations in measurements or random variations in the impulse response of a system can cause inconsistencies. Our algorithm projects onto a subcollection of sets some of which carry a random realization of noise on it. The implementation results show that the algorithm converges to the solution asymptotically even if the algorithm projects onto a random subcollection of sets at each iteration. All in all this thesis work presents iterative methods to solve stochastic convex minimization problems and stochastic convex set intersection problems. The almost sure convergence of algorithms are proven. And the performance of them are shown on numerical experiments. Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-07-09T20:53:53Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Tursun_Umit.pdf: 2116513 bytes, checksum: 115f4cdd5986cfb71f922cc662d017bf (MD5) Made available in DSpace on 2013-08-22T16:38:27Z (GMT). No. of bitstreams: 2 Umit_Tursun.pdf: 2116513 bytes, checksum: 115f4cdd5986cfb71f922cc662d017bf (MD5) license.txt: 4060 bytes, checksum: 70e177b67419849cf6c6b61c35021bf0 (MD5) Restriction data tranferred 2014-07-01T11:11:23-05:00 Original Data Group with Access Administrator Release Date: 2015-10-21 12:15:23 UTC Reason: Graduate College approved embargo for two years per email received 10/21/2013 sshreeve Item marked as restricted to the 'Administrator' Group (id=1) by Sarah Shreeves (sshreeve@illinois.edu) on 2013-10-21T17:15:25Z Item is restricted until 2015-10-21T17:15:23Z Author's request via GC. U of I Only http://hdl.handle.net/2142/45381 en Copyright 2013 Umit Tursun stochastic convex minimization random projection stochastic convex feasibility problem Random projection methods for stochastic convex minimization text Industrial&Enterprise Sys Eng 1422 Industrial Engineering 0127 University of Illinois at Urbana-Champaign Dissertation Ph.D. PHD:Industrial Enginerng -UIUC 10KS0127PHD