Sökning: "Optimization problems"

Visar resultat 16 - 20 av 730 avhandlingar innehållade orden Optimization problems.

  1. 16. Product Configuration from a Mathematical Optimization Perspective

    Författare :Peter Lindroth; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; optimization; multiple objectives; platform-based products; heavy-duty trucks; configuration management; categorical variables; global optimization; robustness; categorical variables;

    Sammanfattning : The optimal truck configuration for a certain customer is very specific and depends on for what transport mission and in which operating environment the truck is to be used. In addition, the customers normally specify other feature requirements ranging from visual appearance to advanced driver support systems. LÄS MER

  3. 17. Runge–Kutta Time Step Selection for Flow Problems

    Författare :Karl Hörnell; Per Lötstedt; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Runge-Kutta; stepsize selection; optimization; flow problems; numerical analysis; Numerical Analysis; Numerisk analys;

    Sammanfattning : Optimality is studied for Runge-Kutta iteration for solving steady-state and time dependent flow problems. For the former type an algorithm for determining locally optimal time steps is developed, based on the fact that the squared norm of the residual produced by an m-stage scheme is a 2m-degree polynomial, the coefficients of which can be computed from scalar products of Krylov subspace vectors. LÄS MER

  4. 18. Decentralized Constrained Optimization: a Novel Convergence Analysis

    Författare :Firooz Shahriari Mehr; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Constrained optimization; Decentralized optimal transport; Distributed optimization; Multi-agent systems; Convergence analysis; Convex optimization;

    Sammanfattning : One reason for the spectacular success of machine learning models is the appearance of large datasets. These datasets are often generated by different computational units or agents and cannot be processed on a single machine due to memory and computing limitations. LÄS MER

  5. 19. Application of the quantum approximate optimization algorithm to combinatorial optimization problems

    Författare :Pontus Vikstål; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; combinatorial optimization; quantum computing; Quantum approximate optimization algorithm;

    Sammanfattning : This licentiate thesis is an extended introduction to the accompanying papers, which encompass a study of the quantum approximate optimization algorithm (QAOA). It is a hybrid quantum-classical algorithm for solving combinatorial optimization problems and is a promising algorithm to run on near term quantum devices. LÄS MER

  7. 20. Convergence and stability analysis of stochastic optimization algorithms

    Författare :Måns Williamson; Matematik LTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; numerical analysis; optimization; stochastic optimization; machine learning;

    Sammanfattning : This thesis is concerned with stochastic optimization methods. The pioneering work in the field is the article “A stochastic approximation algorithm” by Robbins and Monro [1], in which they proposed the stochastic gradient descent; a stochastic version of the classical gradient descent algorithm. LÄS MER