Sökning: "Monotone Inclusion"

Hittade 3 avhandlingar innehållade orden Monotone Inclusion.

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

  4. 3. Natural deduction for intuitionistic least and greatest fixedpoint logics : with an application to program construction

    Författare :Tarmo Uustalu; KTH; []
    Nyckelord :;

    Sammanfattning : This thesis discusses intuitionistic least and greatest fixedpoint logics, i.e., intuitionistic systems of logic with primitive predicate-valued operators on predicate transformers that send monotone predicate transformers to their least and greatest fixedpoints, predicates being quasiordered by inclusion. LÄS MER