Sökning: "numerical optimization"

Visar resultat 26 - 30 av 401 avhandlingar innehållade orden numerical optimization.

  1. 26. Asynchronous First-Order Algorithms for Large-Scale Optimization : Analysis and Implementation

    Författare :Arda Aytekin; Mikael Johansson; Lin Xiao; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; convex; optimization; asynchronous; algorithms; parallel; distributed; large-scale; big data; software; serverless; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : Developments in communication and data storage technologies have made large-scale data collection more accessible than ever. The transformation of this data into insight or decisions typically involves solving numerical optimization problems. LÄS MER

  3. 27. 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. 28. A convex optimization approach to complexity constrained analytic interpolation with applications to ARMA estimation and robust control

    Författare :Anders Blomqvist; Anders Lindquist; Giorgio Picci; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematical optimization; systems theory; analytic interpolation; moment matching; Nevanlinna-Pick interpolation; spectral estimation; convex optimization; Optimeringslära; systemteori; Optimization; systems theory; Optimeringslära; systemteori;

    Sammanfattning : Analytical interpolation theory has several applications in systems and control. In particular, solutions of low degree, or more generally of low complexity, are of special interest since they allow for synthesis of simpler systems. LÄS MER

  5. 29. Subspace Computations via Matrix Decompositions and Geometric Optimization

    Författare :Lennart Simonsson; Axel Ruhe; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Numerical Analysis; Rank-revealing UTV; Jacobi-Davidson algorithm; Decomposition; Grassmann type algorithms; Numerical analysis; Numerisk analys;

    Sammanfattning : This thesis is concerned with the computation of certain subspaces connected to a given matrix, where the closely related problem of approximating the matrix with one of lower rank is given special attention. To determine the rank and obtain bases for fundamental subspaces such as the range and null space of a matrix, computing the singular value decomposition (SVD) is the standard method. LÄS MER

  7. 30. Gradient-based optimization of non-linear structures and materials

    Författare :Anna Dalklint; Hållfasthetslära; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Topology optimization; Shape optimization; Finite strain; Eigenvalue problems; Soft robotics;

    Sammanfattning : Gradient-based optimization is a potent tool in many design processes today. It is particularly useful in industries where weight considerations are crucial, such as aerospace, but can also be exploited in for example civil engineering applications to reduce the material use and thereby the environmental impact. LÄS MER