Sökning: "subgradient method"

Visar resultat 1 - 5 av 6 uppsatser innehållade orden subgradient method.

  1. 1. Lagrangian Bounding and Heuristics for Bi-Objective Discrete Optimisation

    Kandidat-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Ida Åkerholm; [2022]
    Nyckelord :Lagrangian relaxation; bi-objective optimisation; Pareto frontier; heuristics; discrete optimisation;

    Sammanfattning : For larger instances of multi-objective optimisation problems, the exact Pareto frontier can be both difficult and time-consuming to calculate. There is a wide range of methods to find feasible solutions to such problems, but techniques for finding good optimistic bounds to compare the feasible solutions with are missing. LÄS MER

  3. 2. Concept Design Improvement of Shift Fork for New Dog Clutch Actuator : Simulation driven product development approach

    Master-uppsats, Jönköping University/JTH, Industriell produktutveckling, produktion och design

    Författare :Nirmal Srinivasan; [2021]
    Nyckelord :Product development; Dynamic analysis; Equivalent-static load; Finite Element Method; Fatigue analysis; High-Pressure Die Casting; Computer-Aided Engineering; Computer-Aided Design; Topology optimization.;

    Sammanfattning : Kongsberg Automotive is developing a brand-new actuator for engaging and disengaging a clutch for different driveline applications. This master thesis research improves the concept design of the shift fork for the new Dog-Clutch Actuator using Design for Manufacturability (DFM). LÄS MER

  4. 3. Recovery of primal solutions from dual subgradient methods for mixed binary linear programming; a branch-and-bound approach

    Master-uppsats, Göteborgs universitet/Institutionen för matematiska vetenskaper

    Författare :Pauline Aldenvik; Mirjam Schierscher; [2015-10-06]
    Nyckelord :Branch-and-bound method; subgradient method; Lagrangian dual; recovery of primal solutions; ergodic sequence; mixed binary linear programming; set covering; facility location;

    Sammanfattning : The main objective of this thesis is to implement and evaluate a Lagrangian heuristic and a branch-and-bound algorithm for solving a class of mathematical optimization problems called mixed binary linear programs. The tests are performed on two different types of mixed binary linear programs: the set covering problem and the (uncapacitated as well as capacitated) facility location problem. LÄS MER

  5. 4. Privacy preserving car-parking: adistributed approach

    L3-uppsats, KTH/Reglerteknik

    Författare :Elisabetta Alfonsetti; [2012]
    Nyckelord :;

    Sammanfattning : There has been a substantial interest recently in privacy preserving problems in various application domains, including data publishing, data mining, classication, secret voting, private querying of database, playing mental poker, and many others. The main constraint is that entities involved in the system are unwilling to reveal the data they hold or make them public. LÄS MER

  7. 5. Distributed Multi-Agent Optimization via Dual Decomposition

    Master-uppsats, KTH/Reglerteknik

    Författare :Håkan Terelius; [2010]
    Nyckelord :;

    Sammanfattning : In this master thesis, a new distributed multi-agent optimization algorithm is introduced. The algorithm is based upon the dual decomposition of the optimization problem, together with the subgradient method for finding the optimal dual solution. LÄS MER