Sökning: "search methods"

Visar resultat 1 - 5 av 666 avhandlingar innehållade orden search methods.

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

3. 2. Robust machine learning methods

   Författare :Muhammad Osama; Dave Zachariah; Thomas B. Schön; Visa Koivunen; Uppsala universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; artificial intelligence; machine learning; risk minimization; data corruption; decision policy; conformal methods; data from contexts; online learning; spice; robust; causal inference; point process; localization; distribution uncertainty; treatment rules; quantile treatment; predicting count data; Electrical Engineering with specialization in Signal Processing; Elektroteknik med inriktning mot signalbehandling;

   Sammanfattning : We are surrounded by data in our daily lives. The rent of our houses, the amount of electricity units consumed, the prices of different products at a supermarket, the daily temperature, our medicine prescriptions, our internet search history are all different forms of data. Data can be used in a wide range of applications. LÄS MER

4. 3. Production scheduling and shipment planning at oil refineries : optimization based methods

   Författare :Jan A. Persson; Bjørn Nygreen; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : In the oil refinery industry, companies need to have a high utilization of production, storage, and transportation resources to be competitive. This can only be achieved by proper planning The purpose of this thesis is to contribute to the development of optimization models and solution methods that support the scheduling and planning at refinery companies. LÄS MER

5. 4. Initialization Methods for System Identification

   Författare :Christian Lyzell; Lennart Ljung; Martin Enqvist; Magnus Jansson; Linköpings universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; System identification; Initialization methods; Regressor selection; Identifiability; Automatic control; Reglerteknik;

   Sammanfattning : In the system identification community a popular framework for the problem of estimating a parametrized model structure given a sequence of input and output pairs is given by the prediction-error method. This method tries to find the parameters which maximize the prediction capability of the corresponding model via the minimization of some chosen cost function that depends on the prediction error. LÄS MER

7. 5. Approaches to accelerate methods for solving systems of equations arising in nonlinear optimization

   Författare :David Ek; Anders Forsgren; Jacek Gondzio; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Nonlinear optimization; mathematical programming; interior-point methods; approximate solutions to systems of linear equations; method of conjugate gradients; quasi-Newton methods; modified Newton methods; Ickelinjär optimering; matematisk programmering; inre-punktsmetoder; approximativa lösningar till linjära ekvationssystem; konjugerade gradientmetoden; kvasi-Newtonmetoder; modifierade Newtonmetoder.; Optimization and Systems Theory; Optimeringslära och systemteori;

   Sammanfattning : Methods for solving nonlinear optimization problems typically involve solving systems of equations. This thesis concerns approaches for accelerating some of those methods. In our setting, accelerating involves finding a trade-off between the computational cost of an iteration and the quality of the computed search direction. LÄS MER