Search for dissertations about: "Optimization algorithms"

Showing result 1 - 5 of 517 swedish dissertations containing the words Optimization algorithms.

  1. 1. Asynchronous Algorithms for Large-Scale Optimization : Analysis and Implementation

    Author : Arda Aytekin; Mikael Johansson; Panagiotis K. Patrinos; KTH; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; convex optimization; optimization; asynchronous algorithms; algorithms; parallel algorithms; large-scale; big data; Electrical Engineering; Elektro- och systemteknik;

    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

  2. 2. A bilevel approach to parameter tuning of optimization algorithms using evolutionary computing : Understanding optimization algorithms through optimization

    Author : Martin Andersson; Amos Ng; Sunith Bandaru; Kalyanmoy Deb; Juergen Branke; Högskolan i Skövde; []
    Keywords : SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Production and Automation Engineering; Produktion och automatiseringsteknik;

    Abstract : Most optimization problems found in the real world cannot be solved using analytical methods. For these types of difficult optimization problems, an alternative approach is needed. READ MORE

  3. 3. On Some Combinatorial Optimization Problems : Algorithms and Complexity

    Author : Hannes Uppman; Peter Jonsson; Christer Bäckström; Ulf Nilsson; Stanislav Živný; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computational complexity; optimization; constraint satisfaction problem;

    Abstract : This thesis is about the computational complexity of several classes of combinatorial optimization problems, all related to the constraint satisfaction problems.A constraint language consists of a domain and a set of relations on the domain. For each such language there is a constraint satisfaction problem (CSP). READ MORE

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

    Author : Arda Aytekin; Mikael Johansson; Lin Xiao; KTH; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; convex; optimization; asynchronous; algorithms; parallel; distributed; large-scale; big data; software; serverless; Electrical Engineering; Elektro- och systemteknik;

    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. 5. Accelerating Convergence of Large-scale Optimization Algorithms

    Author : Euhanna Ghadimi; Mikael Johansson; Angelia Nedich; KTH; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Convex optimization; Large-scale systems; First-order methods; Convergence analysis; ADMM; Optimization algorithms; Electrical Engineering; Elektro- och systemteknik; Matematik; Mathematics;

    Abstract : Several recent engineering applications in multi-agent systems, communication networks, and machine learning deal with decision problems that can be formulated as optimization problems. For many of these problems, new constraints limit the usefulness of traditional optimization algorithms. READ MORE