Sökning: "subgradient methods"

Visar resultat 1 - 5 av 12 avhandlingar innehållade orden subgradient methods.

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

  4. 3. Optimization of Maintenance Planning for Multi-Component Systems, and Primal-Dual Convergence Characterizations in Convex Optimization

    Författare :Magnus Önnheim; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; subgradient methods; Lagrangian dual; primal recovery; inconsistent convex programs; ergodic sequences; maintenance scheduling; preventive maintenance; deterioration cost; deterioration cost;

    Sammanfattning : This thesis considers two topics within mathematical programming. The first topic is an investigation into the behaviour of primal-dual subgradient algorithms with primal ergodic averaging in the case where it is not known a priori whether the primal program is consistent or not. 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. Decomposition Methods for Combinatorial Optimization

    Författare :Uledi Ngulo; Torbjörn Larsson; Nils-Hassan Quttineh; Egbert Mujuni; Athanasios Migdalas; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis aims at research in the field of combinatorial optimization. Problems within this field often posses special structures allowing them to be decomposed into more easily solved subproblems, which can be exploited in solution methods. These structures appear frequently in applications. LÄS MER