Search for dissertations about: "Linearly convex"
Showing result 1 - 5 of 8 swedish dissertations containing the words Linearly convex.
-
1. On complex convexity
Abstract : This thesis is about complex convexity. We compare it with other notions of convexity such as ordinary convexity, linear convexity, hyperconvexity and pseudoconvexity. We also do detailed study about ℂ-convex Hartogs domains, which leads to a definition of ℂ-convex functions of class C1. READ MORE
-
2. Asynchronous First-Order Algorithms for Large-Scale Optimization : Analysis and Implementation
Abstract : 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. READ MORE
-
3. Distributed Optimization and Control : Primal--Dual, Online, and Event-Triggered Algorithms
Abstract : In distributed optimization and control, each network node performs local computation based on its own information and information received from its neighbors through a communication network to achieve a global objective. Although many distributed optimization and control algorithms have been proposed, core theoretical problems with important practical relevance remain. READ MORE
-
4. Improved Frank-Wolfe directions with applications to traffic problems
Abstract : The main contribution of this thesis is the development of some new efficient algorithms for solving structured linearly constrained optimization problems. The conventional Frank-Wolfe method is one of the most frequently used methods for solving such problems. READ MORE
-
5. 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