Search for dissertations about: "Convex function"

Showing result 1 - 5 of 97 swedish dissertations containing the words Convex function.

2. 1. Algebras of bounded holomorphic functions

   Author : Anders Fällström; Umeå universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; holomorphic function; bounded holomorphic function; domain of holomorphy; envelope of holomorphy; Gleason’s problem; convex set; uniform algebra; spectrum; fibers; generalized Shilov boundary; analytic structure; plurisubharmonic function;

   Abstract : Some problems concerning the algebra of bounded holomorphic functions from bounded domains in Cn are solved. A bounded domain of holomorphy Q in C2 with nonschlicht i7°°- envelope of holomorphy is constructed and it is shown that there is a point in Q for which Gleason’s Problem for H°°(Q) cannot be solved. READ MORE

4. 2. Envelopes of holomorphy for bounded holomorphic functions

   Author : Ulf Backlund; Umeå universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; holomorphicfunction; boundedholomorphic function; domain of holo¬ morphy; envelope of holomorphy; Gleason’s problem; convex set; plurisubharmonic function; pluripolar set; poly normally convex set;

   Abstract : Some problems concerning holomorphic continuation of the class of bounded holo­morphic functions from bounded domains in Cn that are domains of holomorphy are solved. A bounded domain of holomorphy Ω in C2 with nonschlicht H°°-envelope of holomorphy is constructed and it is shown that there is a point in D for which Glea­son’s Problem for H°°(Ω) cannot be solved. READ MORE

5. 3. Large deviation techniques applied to three questions of when

   Author : Ola Hammarlid; Anders Martin-Löf; Ingmar Kaj; Stockholms universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Large deviations; first passage time; stopping time; rate function; convex barrier; fallacy of large numbers; utility function; insurance; ruin; variable premium; generalized Ornstein-Uhlenbeck process; Mathematical statistics; Matematisk statistik;

   Abstract : Large deviation techniques are used to solve three problems; when is a distant convex barrier passed, when to accept a sequence of gambles and when is the time of ruin. This work is the collection of four papers. READ MORE

6. 4. Topics in convex and mixed binary linear optimization

   Author : Emil Gustavsson; Göteborgs universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; subgradient methods; Lagrangian dual; recovery of primal solutions; inconsistent convex programs; ergodic sequences; convex optimization; mixed binary linear optimization; maintenance scheduling; preventive maintenance; deterioration cost; inconsistent convex programs;

   Abstract : This thesis concerns theory, algorithms, and applications for two problem classes within the realm of mathematical optimization; convex optimization and mixed binary linear optimization. To the thesis is appended five papers containing its main contributions. READ MORE

7. 5. Non-overlapping Germ-grain Models: Characteristics and Material Modelling

   Author : Jenny Andersson; Göteborgs universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Poisson process; Convex sets; Material fatigue; Voronoi tessellation; Germ-grain process; Pair-correlation function; Mark-correlation function; Short cracks; Volume fraction; Germ-grain process;

   Abstract : We consider three different non--overlapping germ--grain models, two of which are constructed in a similar fashion. These two models are generalisations of Mat\'ern's hard--core models. In both cases we start with a homogeneous Poisson process and use the points as centres of convex sets, grains, of the same shape. READ MORE