Sökning: "Fixed-Point Iterations"

Visar resultat 1 - 5 av 9 avhandlingar innehållade orden Fixed-Point Iterations.

  1. 1. Residue fixed point index and wildly ramified power series

    Författare :Jonas Nordqvist; Karl-Olof Lindahl; Robert Laurent Benedetto; Linnéuniversitetet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; wildly ramified power series; residue fixed point index; formal invariant; iterative residue; ramification numbers; non-archimedean; discrete dynamical systems; arithmetic dynamics; periodic points; Nottingham group; Mathematics; Matematik;

    Sammanfattning : This thesis concerns discrete dynamical systems. These are systems where the dynamics is modeled by iterated functions. There are several applications of discrete dynamical system e.g. LÄS MER

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

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

    Sammanfattning : 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. LÄS MER

  4. 3. Efficient and Flexible First-Order Optimization Algorithms

    Författare :Hamed Sadeghi; Institutionen för reglerteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Monotone Inclusion; Convex Optimization; First-Order Methods; Fixed-Point Iterations; Forward–Backward Splitting; Primal–Dual Algorithm;

    Sammanfattning : Optimization problems occur in many areas in science and engineering. When the optimization problem at hand is of large-scale, the computational cost of the optimization algorithm is a main concern. LÄS MER

  5. 4. Reinforcement Learning and Dynamical Systems

    Författare :Björn Lindenberg; Karl-Olof Lindahl; Marc G. Bellemare; Linnéuniversitetet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; artificial intelligence; distributional reinforcement learning; Markov decision processes; Bellman operators; deep learning; multi-armed bandits; Bayesian bandits; conjugate priors; Thompson sampling; linear finite dynamical systems; cycle orbits; fixed-point systems; Mathematics; Matematik; Computer Science; Datavetenskap;

    Sammanfattning : This thesis concerns reinforcement learning and dynamical systems in finite discrete problem domains. Artificial intelligence studies through reinforcement learning involves developing models and algorithms for scenarios when there is an agent that is interacting with an environment. LÄS MER

  7. 5. Fixed points, fractals, iterated function systems and generalized support vector machines

    Författare :Xiaomin Qi; Sergei Silvestrov; Anatoliy Malyarenko; Daniel Andren; Viktor Abramov; Mälardalens högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; support vector machine; fixed points; iterated function system; variational inequality; Mathematics Applied Mathematics; matematik tillämpad matematik;

    Sammanfattning : In this thesis, fixed point theory is used to construct a fractal type sets and to solve data classification problem. Fixed point method, which is a beautiful mixture of analysis, topology, and geometry has been revealed as a very powerful and important tool in the study of nonlinear phenomena. LÄS MER