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 4 of 4 for “"Convex Feasibility Problem"”.
-
RADIAL PROJECTIONS, CONVEX FEASIBILITY PROBLEMS AND MARGIN MAXIMIZATION
… work comprises two parts. Part I focuses on the convex feasibility problem (finding or approximating a point in the intersection of finitely many closed convex sets). We avoid the need for orthogonal projections by using radial projections, introduced by Renegar. The main requirement is that an …
-
Certifying stability in runge-kutta schemes: Algebraic conditions and semidefinite programming
… stability function satisfying a particular convex feasibility problem. Specifically, up to a transformation, the stability function lies in the convex cone of positive functions. In recent years, sum-of-squares optimization and semidefinite programming have become valuable tools in …
-
Random projection methods for stochastic convex minimization
… 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 …
-
Optimal mean-square performance for networked control systems with unreliable communication
… processes.</p> <p>We first focus on the analysis problem in general. We derive a convex feasibility problem and associated convex optimization problem</p> <p>which can be used to determine the MS stability and MS performance respectively of a given system. Since this analysis theory is derived in …