Sökning: "Convex programming"
Visar resultat 1 - 5 av 56 avhandlingar innehållade orden Convex programming.
1. On Some Properties of Interior Methods for Optimization
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
2. Model Reduction Using Semidefinite Programming
Sammanfattning : 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. LÄS MER
3. Approximate Dynamic Programming with Applications
Sammanfattning : 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. LÄS MER
4. Optimal Powertrain Dimensioning and Potential Assessment of Hybrid Electric Vehicles
Sammanfattning : 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. LÄS MER
5. Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization
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