Search for dissertations about: "Convex programming"
Showing result 1 - 5 of 55 swedish dissertations containing the words Convex programming.
-
1. On Some Properties of Interior Methods for Optimization
Abstract : 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. READ MORE
-
2. Model Reduction Using Semidefinite Programming
Abstract : In this thesis model reduction methods for linear time invariant systems are investigated. The reduced models are computed using semidefinite programming. Two ways of imposing the stability constraint are considered. However, both approaches add a positivity constraint to the program. READ MORE
-
3. Approximate Dynamic Programming with Applications
Abstract : This thesis studies approximate optimal control of nonlinear systems. Particular attention is given to global solutions and to the computation of approximately optimal feedback controllers. The solution to an optimal control problem is characterized by the optimal value function. READ MORE
-
4. Optimal Powertrain Dimensioning and Potential Assessment of Hybrid Electric Vehicles
Abstract : Hybrid electric vehicles (HEVs), compared to conventional vehicles, complement the traditional combustion engine with one, or several electric motors and an energy buffer, typically a battery and/or an ultracapacitor. This gives the vehicle an additional degree of freedom that allows for a more efficient operation, by e.g. READ MORE
-
5. Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization
Abstract : 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. READ MORE