Sökning: "Nonsmooth Optimization"

Hittade 5 avhandlingar innehållade orden Nonsmooth Optimization.

  1. 1. Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization

    Författare :Ann-Brith Strömberg; Vladimir F. Dem'yanov; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; ergodic convergence; nonsmooth optimization; primal convergence; subgradient methods; conditional subgradient; Convex programming; Lagrangean relaxation;

    Sammanfattning : The topic of the thesis is subgradient optimization methods in convex, nonsmooth optimization. These methods are frequently used, especially in the context of Lagrangean relaxation of large scale mathematical programs where they are remarkably often able to quickly identify near-optimal Lagrangean dual solutions. LÄS MER

  3. 2. Convergence Analysis and Improvements for Projection Algorithms and Splitting Methods

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

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

  4. 3. Contributions to dual subgradient optimization and maintenance scheduling

    Författare :Emil Gustavsson; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Subgradient optimization; Lagrangian duality; convex programming; maintenance scheduling; integer optimization; Lagrangian duality;

    Sammanfattning : This thesis analyses two topics within the area of mathematical optimization; dual subgradient methods and maintenance optimization. The first two papers consider dual subgradient methods, and the third paper considers maintenance optimization. LÄS MER

  5. 4. Topics in convex and mixed binary linear optimization

    Författare :Emil Gustavsson; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; subgradient methods; Lagrangian dual; recovery of primal solutions; inconsistent convex programs; ergodic sequences; convex optimization; mixed binary linear optimization; maintenance scheduling; preventive maintenance; deterioration cost; inconsistent convex programs;

    Sammanfattning : This thesis concerns theory, algorithms, and applications for two problem classes within the realm of mathematical optimization; convex optimization and mixed binary linear optimization. To the thesis is appended five papers containing its main contributions. LÄS MER

  7. 5. Accelerated granular matter simulation

    Författare :Da Wang; Martin Servin; Jin Ooi; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; discrete element method; nonsmooth contact dynamics; multibody dynamics; granular media; simulation; projected Gauss-Seidel; validation; iron ore pellets; pelletising balling circuit; model reduction; design optimization;

    Sammanfattning : Modeling and simulation of granular matter has important applications in both natural science and industry. One widely used method is the discrete element method (DEM). It can be used for simulating granular matter in the gaseous, liquid as well as solid regime whereas alternative methods are in general applicable to only one. LÄS MER