Search for dissertations about: "First-order approach"

Showing result 1 - 5 of 97 swedish dissertations containing the words First-order approach.

  2. 1. Efficient and Flexible First-Order Optimization Algorithms

    Author : Hamed Sadeghi; Institutionen för reglerteknik; []
    Keywords : 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;

    Abstract : 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. READ MORE

  4. 2. 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. 3. New techniques for handling quantifiers in Boolean and first-order logic

    Author : Peter Backeman; Philipp Rümmer; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap med inriktning mot inbyggda system; Computer Science with specialization in Embedded Systems;

    Abstract : The automation of reasoning has been an aim of research for a long time. Already in 17th century, the famous mathematician Leibniz invented a mechanical calculator capable of performing all four basic arithmetic operators. READ MORE

  6. 4. Quantifiers and Theories : A Lazy Approach

    Author : Peter Backeman; Philipp Rümmer; Jie-Hong Roland Jiang; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Automated Reasoning; Automated Theorem Proving; SMT; Unification; Datavetenskap med inriktning mot inbyggda system; Computer Science with specialization in Embedded Systems;

    Abstract : In this thesis we study Automated Theorem Proving (ATP) as well as Satisfiability Modulo Theories (SMT) and present lazy strategies for improving reasoning within these areas. A lazy strategy works by simplifying a problem, and gradually refines the abstraction only when necessary. 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