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 20 of 114 for “"Convex Set"”.

  1. Convex Set Approximation Problems in Quantum Information

    This thesis investigates methods to approximate convex sets which involve minimizing the Hausdorff metric between a set and certain subsets. We begin by giving a lower bound for the Hausdorff metric between a hypersphere and a circumscribed simplex. We show that this bound is achieved by the …

    guelph Repository record for Convex Set Approximation Problems in Quantum Information (opens in a new tab)

  2. Topics in the Design of Political and Economic Mechanisms

    … the third essay analyzes conditions for the convexifiability of an agent's utility $u(a)$ viewed a function of his type. The study shows that if the set of types A is an m-dimensional rectangle, $m\ge1,$ then u can be assumed convex in a without loss of generality. In particular, in any …

    uiuc Repository record for Topics in the Design of Political and Economic Mechanisms (opens in a new tab)

  3. ORDER CLOSEDNESS OF CONVEX SETS IN BANACH LATTICES

    … of risk measures asks when order closedness of a convex set in X guarantees closedness with respect to the topology generated by the order continuous dual of X. In this thesis, we present a characterization of when the problem has a positive answer for a wide class of Banach lattices. We also show …

    nus Repository record for ORDER CLOSEDNESS OF CONVEX SETS IN BANACH LATTICES (opens in a new tab) Download file for ORDER CLOSEDNESS OF CONVEX SETS IN BANACH LATTICES (opens in a new tab)

  4. Theories of Fixed Point Index and Applications

    … In Chapter 2 we study approximatively compact sets giving examples and proving new results. The concept of an approximatively compact set is of importance in defining our index for a generalized inward map since there exists upper semicontinuous multivalued metric projections onto the …

    glasgow Download PDF for Theories of Fixed Point Index and Applications (opens in a new tab)

  5. Convex sets with lattice point constraints / by Poh Wah Awyong.

    … with obtaining new inequalities for a planar, convex set containing exactly 0, 1 or 2 lattice points in its interior.

    adelaide Repository record for Convex sets with lattice point constraints / by Poh Wah Awyong. (opens in a new tab)

  6. Fundamental properties of convex mixed-integer programs

    … foundations of various fundamental concepts in convex mixed-integer programs (MIPs), that is, optimization problems where all the decision variables belong to a given convex set and, in addition, a subset of them are required to be integer. In particular, we study properties of their feasible …

    gatech Repository record for Fundamental properties of convex mixed-integer programs (opens in a new tab)

  7. On the range of the Attenuated Radon Transform in strictly convex sets.

    … and two tensor fields, supported in strictly convex set. The approach is based on a Hilbert transform associated with A-analytic functions of A. Bukhgeim. We first present new necessary and sufficient conditions for a function to be in the range of the attenuated Radon transform of a …

    ucf Repository record for On the range of the Attenuated Radon Transform in strictly convex sets. (opens in a new tab)

  8. Blur And Illumination Robust Face Recognition VIA Set-Theoretic Characterization

    … of blur and illumination. We show that the set of all images obtained by blurring a given image forms a convex set. Based on this set-theoretic characterization, we propose a blur-robust algorithm whose main step involves solving simple convex optimization problems. We do not assume any …

    maryland Repository record for Blur And Illumination Robust Face Recognition VIA Set-Theoretic Characterization (opens in a new tab)

  9. Graph Convexity and Vertex Orderings

    In discrete mathematics, a convex space is an ordered pair (V,M) where M is a family of subsets of a finite set V , such that: ∅ ∈M, V ∈M, andMis closed under intersection. The elements of M are called convex sets. For a set S ⊆ V , the convex hull of S is the smallest convex set that contains S. A …

    uvic Repository record for Graph Convexity and Vertex Orderings (opens in a new tab)

  10. On Resampling Schemes for Uniform Polytopes

    The convex hull of a sample is used to approximate the support of the underlying distribution. This approximation has many practical implications in real life. For example, approximating the boundary of a finite set is used by many authors in environmental studies and medical research. To …

    ottawa-retro Repository record for On Resampling Schemes for Uniform Polytopes (opens in a new tab)

  11. High resolution signal and image recovery: Fast algorithms and analysis

    … developing fast and efficient algorithms for convex set constrained signal recovery, analyzing resolution limits in signal recovery algorithms, and developing new regularization techniques for reducing the ill effects of noise in signal recovery algorithms.

    uiuc Repository record for High resolution signal and image recovery: Fast algorithms and analysis (opens in a new tab)

  12. 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.

    uiuc Repository record for Convex lattice polygons (opens in a new tab)

  13. Classes of Banach spaces connected with the Lyapunov convexity

    … in a finite dimensional space is a compact and convex set. This result, first obtained by A. A. Lyapunov in 1940 attracted the attention of many mathematicians. It is known that the Lyapunov theorem is false in the infinite-dimensional case. The aim of this thesis is to develop …

    fu-berlin Repository record for Classes of Banach spaces connected with the Lyapunov convexity (opens in a new tab)

  14. 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 …

    ubc Repository record for Some applications of Choquet’s integral representation theorem to probability (opens in a new tab) Download PDF for Some applications of Choquet’s integral representation theorem to probability (opens in a new tab)

  15. An algorithm for optimization of certain allocation models.

    … problems. Danskin Algorithm for solution of a convex function to be minimized over a closed convex set is developed An example of application involving solution of a 3600 variable allocation problem using a computer is provided. Paper includes analysis of solution and discussion of problems …

    nps Repository record for An algorithm for optimization of certain allocation models. (opens in a new tab)

  16. Problems in Graph Coloring and Graph Structure

    Let F be a family of translates of a fixed convex set in the plane, and let G be the intersection graph of F . We studied the chromatic number of the complement of G. We also studied the transversal number of F , where the transversal number is the minimum size of a set of points that intersects …

    uiuc Repository record for Problems in Graph Coloring and Graph Structure (opens in a new tab)

  17. Tracial simplex of every unital C*-algebra is a Choquet simplex

    … 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.

    york Repository record for Tracial simplex of every unital C*-algebra is a Choquet simplex (opens in a new tab)

  18. Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems

    In this dissertation, a new method for obtaining convexity and optimization results for functions with integer and real (i.e. mixed) variables is introduced and this new method is applied to obtain mixed convexity and optimization results for some of the known mixed variable functions in the …

    oklahoma-thes Repository record for Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems (opens in a new tab)

  19. Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems

    In this dissertation, a new method for obtaining convexity and optimization results for functions with integer and real (i.e. mixed) variables is introduced and this new method is applied to obtain mixed convexity and optimization results for some of the known mixed variable functions in the …

    oklahoma-thes Repository record for Mixed Convexity and Optimization Results for Functions with Integer and Real Variables with Applications to Queueing Systems (opens in a new tab)

  20. 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 potential). …

    unt Repository record for Gibbs/Equilibrium Measures for Functions of Multidimensional Shifts with Countable Alphabets (opens in a new tab)

Page 1 of 6