Sökning: "convex optimization"

Visar resultat 1 - 5 av 153 avhandlingar innehållade orden convex optimization.

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

    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

  2. 2. Asynchronous 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.; [2017]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; convex optimization; optimization; asynchronous algorithms; algorithms; parallel algorithms; large-scale; big data; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : This thesis proposes and analyzes several first-order methods for convex optimization, designed for parallel implementation in shared and distributed memory architectures. The theoretical focus is on designing algorithms that can run asynchronously, allowing computing nodes to execute their tasks with stale information without jeopardizing convergence to the optimal solution. 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. On Distributed Optimization in Networked Systems

    Detta är en avhandling från Stockholm : KTH

    Författare :Björn Johansson; KTH.; [2008]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; convex optimization; resource allocation; networked systems; peer-to-peer; distributed optimization; TECHNOLOGY Information technology Telecommunication; TEKNIKVETENSKAP Informationsteknik Telekommunikation; TECHNOLOGY Information technology Automatic control; TEKNIKVETENSKAP Informationsteknik Reglerteknik;

    Sammanfattning : Numerous control and decision problems in networked systems can be posed as optimization problems. Examples include the framework of network utility maximization for resource allocation in communication networks, multi-agent coordination in robotics, and collaborative estimation in wireless sensor networks (WSNs). LÄS MER

  5. 5. A convex optimization approach to complexity constrained analytic interpolation with applications to ARMA estimation and robust control

    Detta är en avhandling från Stockholm : KTH

    Författare :Anders Blomqvist; KTH.; [2005]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematical optimization; systems theory; analytic interpolation; moment matching; Nevanlinna-Pick interpolation; spectral estimation; convex optimization; Optimeringslära; systemteori; MATHEMATICS Applied mathematics Optimization; systems theory; MATEMATIK Tillämpad matematik Optimeringslära; systemteori;

    Sammanfattning : Analytical interpolation theory has several applications in systems and control. In particular, solutions of low degree, or more generally of low complexity, are of special interest since they allow for synthesis of simpler systems. LÄS MER