Search for dissertations about: "convex"

Showing result 1 - 5 of 264 swedish dissertations containing the word convex.

  1. 1. On complex convexity

    University dissertation from Stockholm : Matematiska institutionen

    Author : David Jacquet; Stockholms universitet.; [2008]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; ℂ-convex; Linearly convex; Charathéodory metric; Kobayshi metric; MATHEMATICS; MATEMATIK; matematik; Mathematics;

    Abstract : This thesis is about complex convexity. We compare it with other notions of convexity such as ordinary convexity, linear convexity, hyperconvexity and pseudoconvexity. We also do detailed study about ℂ-convex Hartogs domains, which leads to a definition of ℂ-convex functions of class C1. READ MORE

  2. 2. Topics in convex and mixed binary linear optimization

    University dissertation from Stockholm : Matematiska institutionen

    Author : Emil Gustavsson; Göteborgs universitet.; Gothenburg University.; [2015]
    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;

    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

  3. 3. Rank Reduction with Convex Constraints

    University dissertation from Department of Automatic Control, Lund Institute of Technology, Lund University

    Author : Christian Grussler; [2017]
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; low-rank approximation; model reduction; non-convex optimization; Douglas-Rachford; matrix completion; overlapping norm; k-support norm; atomic norm;

    Abstract : This thesis addresses problems which require low-rank solutions under convex constraints. In particular, the focus lies on model reduction of positive systems, as well as finite dimensional optimization problems that are convex, apart from a low-rank constraint. READ MORE

  4. 4. Convex multicommodity flow problems : a bidual approach

    University dissertation from Linköping : Linköpings universitet

    Author : Kristoffer Hägglöf; Linköpings universitet.; Linköpings universitet.; [2005]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; MATHEMATICS; MATEMATIK;

    Abstract : The topic of this dissertation, within the subfield of mathematics known as optimization, is the development of a new dual ascent method for convex multicommodity flow problems. Convex multicommodity flow problems arize in many different routing problems such as the design of packet switched computer networks and the computation of traffic network equilibria. READ MORE

  5. 5. Positive vector bundles in complex and convex geometry

    University dissertation from Göteborg

    Author : Hossein Raufi; Göteborgs universitet.; Gothenburg University.; [2014]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; holomorphic vector bundles; dbar-equation; L^2-estimates; singular hermitian metrics; Griffiths positivity; Nakano positivity; vanishing theorems; Ohsawa-Takegoshi extension theorem; convex geometry; Prekopa theorem;

    Abstract : This thesis concerns various aspects of the geometry of holomorphic vector bundles and their analytical theory which all, vaguely speaking, are related to the notion of positive curvature in general, and L^2-methods for the dbar-equation in particular. The thesis contains four papers. READ MORE