Avancerad sökning

Visar resultat 1 - 5 av 195 avhandlingar som matchar ovanstående sökkriterier.

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

   Författare :Emil Gustavsson; Göteborgs universitet; []
   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; inconsistent convex programs;

   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. 2. Asynchronous Algorithms for Large-Scale Optimization : Analysis and Implementation

   Författare :Arda Aytekin; Mikael Johansson; Panagiotis K. Patrinos; KTH; []
   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

4. 3. Decentralized Constrained Optimization: a Novel Convergence Analysis

   Författare :Firooz Shahriari Mehr; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Constrained optimization; Decentralized optimal transport; Distributed optimization; Multi-agent systems; Convergence analysis; Convex optimization;

   Sammanfattning : One reason for the spectacular success of machine learning models is the appearance of large datasets. These datasets are often generated by different computational units or agents and cannot be processed on a single machine due to memory and computing limitations. LÄS MER

5. 4. Asynchronous First-Order Algorithms for Large-Scale Optimization : Analysis and Implementation

   Författare :Arda Aytekin; Mikael Johansson; Lin Xiao; KTH; []
   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

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

   Författare :Anders Blomqvist; Anders Lindquist; Giorgio Picci; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematical optimization; systems theory; analytic interpolation; moment matching; Nevanlinna-Pick interpolation; spectral estimation; convex optimization; Optimeringslära; systemteori; Optimization; systems theory; 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