Avancerad sökning

Visar resultat 1 - 5 av 7 avhandlingar som matchar ovanstående sökkriterier.

  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. Applications of Integer Quadratic Programming in Control and Communication

    Författare :Daniel Axehill; Anders Hansson; Anders Rantzer; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Optimization; Model Predictive Control; CDMA; Quadratic Programming; Mixed Integer Quadratic Programming; Dual active set methods; Riccati recursion; Branch and bound; Automatic control; Reglerteknik;

    Sammanfattning : The main topic of this thesis is integer quadratic programming with applications to problems arising in the areas of automatic control and communication. One of the most widespread modern control principles is the discrete-time method Model Predictive Control (MPC). LÄS MER

  4. 3. On Some Properties of Interior Methods for Optimization

    Författare :Göran Sporre; KTH; []
    Nyckelord :Interior method; primal-dual interior method; linear programming; quadratic programming; nonlinear programming; semidefinite programming; weighted least-squares problems; central path;

    Sammanfattning : This thesis consists of four independent papers concerningdifferent aspects of interior methods for optimization. Threeof the papers focus on theoretical aspects while the fourth oneconcerns some computational experiments. LÄS MER

  5. 4. Solution of linear programming and non-linear regression problems using linear M-estimation methods

    Författare :Ove Edlund; Luleå tekniska universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Scientific Computing; Teknisk-vetenskapliga beräkningar;

    Sammanfattning : This thesis is devoted to algorithms for solving two optimization problems, using linear M-estimation methods, and their implementation. First, an algorithm for the non-linear M-estimation problem is considered. LÄS MER

  7. 5. Topics in Sparse Least Squares Problems

    Författare :Mikael Adlers; Michael A. Saunders; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis addresses topics in sparse least squares computation. A stable method for solving the least squares problem, min ||Ax-b||2 is based on the QR factorization.Here we have addressed the difficulty for storing the orthogonal matrix Q. LÄS MER