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 1 of 1 for “"stochastic convex feasibility problem"”.

  1. Random projection methods for stochastic convex minimization

    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 …

    uiuc Repository record for Random projection methods for stochastic convex minimization (opens in a new tab)