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 17 of 17 for “"compact convex set"”.
-
Convex lattice polygons
… deals with three main extremal problems on convex lattice polygons in the plane. A convex lattice polygon is the intersection of a compact convex set with the integer lattice (the set of all points with integer coordinates). Let P represent a convex lattice polygon.
-
Some applications of Choquet’s integral representation theorem to probability
… R[sup ∞] equipped with the product topology. The set of all superharmonic functions is shown to be a compact convex metrizable subset of R[sup ∞]. Furthermore the extreme points are isolated and they turn out to be the minimal harmonic functions. With regards to the other two applications we …
-
Tracial simplex of every unital C*-algebra is a Choquet simplex
… space. Choquet simplex is a special type of compact convex set with a unique representation property. The goal of this thesis is to find a self-contained and easily accessible proof of the classical fact that the set of tracial states of a unital C*-algebra is a Choquet simplex.
-
Faster Conditional Gradient Algorithms for Machine Learning
… algorithms, a family of iterative algorithms for convex optimization, that work under the assumption that projections onto the feasible region are prohibitive, but linear optimization problems can be efficiently solved over the feasible region. We present several algorithms that either locally or …
-
Optimization Methods in Geometric Shape Approximation
… inscribed parallelotopes and boxes in a compact convex set, defined by a finite number of convex inequalities, and presents an optimization approach for solving them. Several optimization models are developed that can be easily generalized to find other inscribed geometric shapes such as …
-
Theories of Fixed Point Index and Applications
… concepts such as cones, wedges, measures of noncompactness and theories of fixed point index for compact and gamma-condensing self-maps. We also give some new results and provide new proofs for some known results. In Chapter 2 we study approximatively compact sets giving examples and proving new …
-
Schur-class of finitely connected planar domains: the test-function approach
We study the structure of the set of extreme points of the compact convex set of matrix-valued holomorphic functions with positive real part on a finitely-connected planar domain 𝐑 normalized to have value equal to the identity matrix at some prescribed point t₀ ∈ 𝐑. This leads to an integral …
-
The Eulerian Bratteli Diagram and Traces on Its Associated Dimension Group
… to the Eulerian Bratteli diagram. It is a compact convex set and we describe its extremal points. Finally, we use this description to give a necessary and sufficient condition for an element of this dimension group to be positive.
-
On Certain Techniques in Convex Geometry
… shows that, by adding new vertices to a convex polygon K, one increases the value of Mahler's functional K --> V (K).V ( K*), thus the minimum of the functional is reached for the convex polygon with least number of vertices. We then study similar techniques in connection to Petty's …
-
Rigidity properties of operator systems and partial order relations in the state space of C*-algebras
… dilation order are concentrated on a particular set. In this thesis, we address this question for general C*-algebras. We show the existence of a projection such that the dilation maximal states are precisely those states which are concentrated on the projection. We also reformulate the …
-
A Convergent Hierarchy of Certificates for Constrained Signomial Positivity
… that of the original problem. Specifically, convex optimization problems are often efficiently solvable, and finding a convex formulation that approximates a nonconvex problem, known as convex relaxation, is an effective approach. This work concerns a particular class of optimization problem, …
-
Gibbs/Equilibrium Measures for Functions of Multidimensional Shifts with Countable Alphabets
… Gibbs measures to be a nonempty, weakly compact, convex set of measures that coincides with the set of measures obeying a form of the DLR equations (which has been adapted so as to be stated entirely in terms of specific internal energy instead of the Hamiltonians for an interaction …
-
A Genesis for Compact Convex Sets
… conditions are sufficient to guarantee that if a compact subset A of a topological linear space L^3 is not convex, then for every point x belonging to the complement of A relative to the convex hull of A there exists a line segment yz such that x belongs to yz and y belongs to A and z belongs to …
-
Asymptotic properties of the branching random walk
… considered. Let <em>C</em><sup>(n)</sup> be the set of points {3<sup>(n)</sup><sub style="position: relative; left: -.8em;">r</sub>/n:r}. It is shown that there is a compact convex set <em>C</em> such that <em>C</em><sup>(n)</sup><sup>Δ</sup><sub style="position: relative; …
-
Basis identification through convex optimization
<p>Suppose one has a highly redundant spanning set for a</p> <p>finite-dimensional Hilbert space, knows that a</p> <p>subset of the spanning set is an orthonormal basis</p> <p>for the space, and wants to identify that subset.</p> <p>To identify such a subset, most standard models</p> <p>typically …
-
Integer programming, lattice algorithms, and deterministic volume estimation
… problems within the geometry of numbers and convex geometry. At a high level, the problems considered in this thesis concern the varied interplay between the continuous and the discrete, an important theme within computer science and operations research. The first subject we consider is the …
-
State-Constrained Rotational and Translational Motion Control with Applications to Monolithic and Distributed Spacecraft
… configuration space is a boundless but compact manifold that has no globally continuous feedback control law. This becomes more troublesome when planning a re-orientation in the presence of rotationally constrained zones. This is of paramount importance as these constraints frequently …