Search for dissertations about: "operator splitting"

Showing result 1 - 5 of 25 swedish dissertations containing the words operator splitting.

  2. 1. Impartial Games and Recursive Functions

    Author : Urban Larsson; Göteborgs universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Algorithmically undecidable; Beatty sequences; Blocking maneuver; Cellular automaton; Comply maneuver; Complementary sequences; Dictionary process; Dual game; Game complexity; Game convergence; Game reflexivity; Heap game; Impartial game; Invariant subtraction game; Move-size dynamic; Nim; P-equivalence; Rule 110; Splitting sequences; *-operator; Subtraction game; Take-away game; Turing complete; Wythoff Nim; Turing complete;

    Abstract : Interest in 2-player impartial games often concerns the famous theory of Sprague-Grundy. In this thesis we study other aspects, bridging some gaps between combinatorial number theory, computer science and combinatorial games. READ MORE

  4. 2. Novel Algorithms for Optimal Transport via Splitting Methods

    Author : Jacob Lindbäck; Mikael Johansson; Jérôme Malick; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; optimal transport; splitting methods; Optimeringslära och systemteori; Optimization and Systems Theory;

    Abstract : This thesis studies how the Douglas–Rachford splitting technique can be leveraged for scalable computational optimal transport (OT). By carefully splitting the problem, we derive an algorithm with several advantages. READ MORE

  5. 3. Fixed Point Iterations for Finite Sum Monotone Inclusions

    Author : Martin Morin; Institutionen för reglerteknik; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; monotone inclusions; operator splitting;

    Abstract : This thesis studies two families of methods for finding zeros of finite sums of monotone operators, the first being variance-reduced stochastic gradient (VRSG) methods. This is a large family of algorithms that use random sampling to improve the convergence rate compared to more traditional approaches. READ MORE

  6. 4. Splitting schemes for nonlinear parabolic problems

    Author : Tony Stillfjord; Matematik LTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : This thesis is based on five papers, which all analyse different aspects of splitting schemes when applied to nonlinear parabolic problems. These numerical methods are frequently used when a problem has a natural decomposition into two or more parts, as the computational cost may then be significantly decreased compared to other methods. READ MORE

  7. 5. Convergence Analysis and Improvements for Projection Algorithms and Splitting Methods

    Author : Mattias Fält; Institutionen för reglerteknik; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; First-order methods; Convex Optimization; Nonsmooth Optimization; Large-scale Optimization; Iterative Methods; Douglas-Rachford splitting; Line Search;

    Abstract : Non-smooth convex optimization problems occur in all fields of engineering. A common approach to solving this class of problems is proximal algorithms, or splitting methods. These first-order optimization algorithms are often simple, well suited to solve large-scale problems and have a low computational cost per iteration. READ MORE