Advanced search
Showing result 1 - 5 of 195 swedish dissertations matching the above criteria.
-
1. Topics in convex and mixed binary linear optimization
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
-
2. Asynchronous Algorithms for Large-Scale Optimization : Analysis and Implementation
Abstract : 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. READ MORE
-
3. Decentralized Constrained Optimization: a Novel Convergence Analysis
Abstract : 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. READ MORE
-
4. Asynchronous First-Order Algorithms for Large-Scale Optimization : Analysis and Implementation
Abstract : 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. READ MORE
-
5. A convex optimization approach to complexity constrained analytic interpolation with applications to ARMA estimation and robust control
Abstract : 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. READ MORE