Sökning: "convex"

Visar resultat 1 - 5 av 269 avhandlingar innehållade ordet convex.

  1. 1. On complex convexity

    Detta är en avhandling från Stockholm : Matematiska institutionen

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

    Sammanfattning : 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. LÄS MER

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

    Detta är en avhandling från Stockholm : Matematiska institutionen

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

    Sammanfattning : 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. LÄS MER

  3. 3. Rank Reduction with Convex Constraints

    Detta är en avhandling från Department of Automatic Control, Lund Institute of Technology, Lund University

    Författare :Christian Grussler; Lund University.; Lunds universitet.; [2017]
    Nyckelord :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;

    Sammanfattning : 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. LÄS MER

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

    Detta är en avhandling från Linköping : Linköpings universitet

    Författare :Kristoffer Hägglöf; Linköpings universitet.; Linköpings universitet.; [2005]

    Sammanfattning : 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. LÄS MER

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

    Detta är en avhandling från Göteborg

    Författare :Hossein Raufi; Göteborgs universitet.; Gothenburg University.; [2014]
    Nyckelord :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;

    Sammanfattning : 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. LÄS MER