Sökning: "fixed-point method"

Visar resultat 1 - 5 av 25 avhandlingar innehållade orden fixed-point method.

  1. 1. 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

  3. 2. Digital lines, Sturmian words, and continued fractions

    Författare :Hanna Uscka-Wehlou; Christer Oscar Kiselman; Maciej Klimek; Gunilla Borgefors; Mikael Passare; Damien Jamet; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; digital geometry; digital line; hierarchy of runs; combinatorics on words; Sturmian word; upper mechanical word; characteristic word; irrational slope; continued fraction; Gauss map; fixed point; Discrete mathematics; Diskret matematik; matematik; Mathematics;

    Sammanfattning : In this thesis we present and solve selected problems arising from digital geometry and combinatorics on words. We consider digital straight lines and, equivalently, upper mechanical words with positive irrational slopes a... LÄS MER

  4. 3. Stochastic Modeling and Simulation of the TCP protocol

    Författare :Jörgen Olsén; Ingemar Kaj; Joachim Charzinski; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematical statistics; TCP; flow-control; network simulator; ns-2; stochastic modeling; throughput; packet loss rate; fixed-point method; Matematisk statistik; Mathematical statistics; Matematisk statistik;

    Sammanfattning : The success of the current Internet relies to a large extent on a cooperation between the users and the network. The network signals its current state to the users by marking or dropping packets. The users then strive to maximize the sending rate without causing network congestion. LÄS MER

  5. 4. Urban Travel Time Estimation from Sparse GPS Data : An Efficient and Scalable Approach

    Författare :Mahmood Rahmani; Harilaos Koutsopoulos; Nikolas Geroliminis; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; map-matching; path inference; sparse GPS probes; floating car data; arterial; urban area; digital road network; iterative travel time estimation; fixed point problem; Stockholm; taxi; Transportvetenskap; Transport Science;

    Sammanfattning : The use of GPS probes in traffic management is growing rapidly as the required data collection infrastructure is increasingly in place, with significant number of mobile sensors moving around covering expansive areas of the road network. Many travelers carry with them at least one device with a built-in GPS receiver. LÄS MER

  7. 5. 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