Avancerad sökning
Visar resultat 1 - 5 av 336 avhandlingar som matchar ovanstående sökkriterier.
1. On complex convexity
Sammanfattning : 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. LÄS MER
2. Topics in convex and mixed binary linear optimization
Sammanfattning : This thesis concerns theory, algorithms, and applications for two problem classes within the realm of mathematical optimization; convex optimization and mixed binary linear optimization. To the thesis is appended five papers containing its main contributions. LÄS MER
3. 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
4. Convex multicommodity flow problems : a bidual approach
Sammanfattning : The topic of this dissertation, within the subfield of mathematics known as optimization, is the development of a new dual ascent method for convex multicommodity flow problems. Convex multicommodity flow problems arize in many different routing problems such as the design of packet switched computer networks and the computation of traffic network equilibria. LÄS MER
5. Positive vector bundles in complex and convex geometry
Sammanfattning : This thesis concerns various aspects of the geometry of holomorphic vector bundles and their analytical theory which all, vaguely speaking, are related to the notion of positive curvature in general, and L^2-methods for the dbar-equation in particular. The thesis contains four papers. LÄS MER