Sökning: "Convex optimization"
Visar resultat 16 - 20 av 195 avhandlingar innehållade orden Convex optimization.
16. Distributed Optimization with Nonconvexities and Limited Communication
Sammanfattning : In economical and sustainable operation of cyber-physical systems, a number of entities need to often cooperate over a communication network to solve optimization problems. A challenging aspect in the design of robust distributed solution algorithms to these optimization problems is that as technology advances and the networks grow larger, the communication bandwidth used to coordinate the solution is limited. LÄS MER
17. Fast local optimization in decision analytic software
Sammanfattning : In decision analysis, significant recognition has been given to the fact that requiring numerically precise information seems unrealistic for real-life decision situations, Despite the emergence of many modern apporaches, which attempt to handle imprecise estimates, concentration has focused more on representation and less on evaluation. Methods such as the DELTA method challenged this issue by its evaluation framework that can accommodate both precision an imprecision, and thus pushes forward the disign of advanced dicision analysis systems. LÄS MER
18. Optimization and Control in Dynamical Network Systems
Sammanfattning : Dynamical network systems are complex interconnected systems useful to describe many real world problems. The advances in information technology has led the current trend towards connecting more and more systems, creating "intelligent" systems, where the intelligence originates in the scale and complexity of the network. LÄS MER
19. Automated Driving Maneuvers - Trajectory Planning via Convex Optimization in the Model Predictive Control Framework
Sammanfattning : Highly automated vehicles have the potential to provide a variety of benefits e.g., decreasing traffic injuries and fatalities while offering people the freedom to choose how to spend their time in their vehicle without jeopardizing the safety of themselves or other traffic participants. LÄS MER
20. Rank Reduction with Convex Constraints
Sammanfattning : This thesis addresses problems which require low-rank solutions under convex constraints. In particular, the focus lies on model reduction of positive systems, as well as finite dimensional optimization problems that are convex, apart from a low-rank constraint. LÄS MER