Sökning: "konvex optimering"

Visar resultat 1 - 5 av 6 avhandlingar innehållade orden konvex optimering.

  1. 1. Multidimensional inverse problems in imaging and identification using low-complexity models, optimal mass transport, and machine learning

    Detta är en avhandling från Stockholm, Sweden : KTH Royal Institute of Technology

    Författare :Axel Ringh; KTH.; [2018]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Inverse problems; convex optimization; variational regularization; trigonometric moment problems; optimal mass transport; computed tomography; machine learning; analytic interpolation; delay systems; Inversa problem; konvex optimering; variationell regularisering; trigonometriska momentproblem; optimal masstransport; datortomografi; maskininlärning; analytisk interpolation; system med tidsfördröjning; Matematik; Mathematics;

    Sammanfattning : This thesis, which mainly consists of six appended papers, primarily considers a number of inverse problems in imaging and system identification.In particular, the first two papers generalize results for the rational covariance extension problem from one to higher dimensions. LÄS MER

  2. 2. On Herglotz-Nevanlinna functions in several variables

    Detta är en avhandling från Stockholm : Department of Mathematics, Stockholm University

    Författare :Mitja Nedic; Stockholms universitet.; [2019]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Herglotz-Nevanlinna functions; several complex variables; integral representations; Nevanlinna measures; Herglotz-Nevanlinnafunktioner; flera komplexa variabler; integralframställningar; Nevanlinnamått; matematik; Mathematics;

    Sammanfattning : In this thesis, we investigate different aspects of the class of Herglotz-Nevanlinna functions in several variables. These are holomorphic functions on the poly-upper half-plane having non-negative imaginary part. Our results are presented in the four research articles A1 - A4, which are included in this thesis. LÄS MER

  3. 3. Asynchronous First-Order Algorithms for Large-Scale Optimization Analysis and Implementation

    Detta är en avhandling från Stockholm : KTH Royal Institute of Technology

    Författare :Arda Aytekin; KTH.; [2019]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; convex; optimization; asynchronous; algorithms; parallel; distributed; large-scale; big data; software; serverless; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : Developments in communication and data storage technologies have made large-scale data collection more accessible than ever. The transformation of this data into insight or decisions typically involves solving numerical optimization problems. LÄS MER

  4. 4. Optimal Decisions with Limited Information

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

    Författare :Ather Gattami; Lund University.; Lunds universitet.; [2007]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; systems; numerical analysis; Computer science; Convex Optimization; Graph Theory; Team Decision Theory; Game Theory; control; Datalogi; numerisk analys; system; kontroll; Automation; robotics; control engineering; Automatiska system; robotteknik; reglerteknik;

    Sammanfattning : This thesis considers static and dynamic team decision problems in both stochastic and deterministic settings. The team problem is a cooperative game, where a number of players make up a team that tries to optimize a given cost induced by the uncertainty of nature. LÄS MER

  5. 5. Robust Algorithms for Multiple View Geometry: Outliers and Optimality

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

    Författare :Olof Enqvist; Lund University.; Lunds universitet.; Lund University.; Lunds universitet.; [2011]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis is concerned with the geometrical parts of computer vision, or more precisely, with the three-dimensional geometry. The overall aim is to extract geometric information from a set of images. Most methods for estimating the geometry of multiple views rely on the existence of robust solvers for a set of basic problems. LÄS MER