Sökning: "convex"

Visar resultat 11 - 15 av 337 avhandlingar innehållade ordet convex.

1. 11. A convex optimization approach to complexity constrained analytic interpolation with applications to ARMA estimation and robust control

   Författare :Anders Blomqvist; Anders Lindquist; Giorgio Picci; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematical optimization; systems theory; analytic interpolation; moment matching; Nevanlinna-Pick interpolation; spectral estimation; convex optimization; Optimeringslära; systemteori; Optimization; systems theory; Optimeringslära; systemteori;

   Sammanfattning : Analytical interpolation theory has several applications in systems and control. In particular, solutions of low degree, or more generally of low complexity, are of special interest since they allow for synthesis of simpler systems. LÄS MER

3. 12. Non-Convex Methods for Compressed Sensing and Low-Rank Matrix Problems

   Författare :Daniele Gerosa; Matematik (naturvetenskapliga fakulteten); []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; compressed sensing; Low-rank Approximation; phase retrieval; Non-convex optimization;

   Sammanfattning : In this thesis we study functionals of the type \( \mathcal{K}_{f,A,\b}(\x)= \mathcal{Q}(f)(\x) + \|A\x - \b \| ^2 \), where \(A\) is a linear map, \(\b\) a measurements vector and \( \mathcal{Q} \) is a functional transform called \emph{quadratic envelope}; this object is a very close relative of the \emph{Lasry-Lions envelope} and its use is meant to regularize the functionals \(f\). Carlsson and Olsson investigated in earlier works the connections between the functionals \( \mathcal{K}_{f,A,\b}\) and their unregularized counterparts \(f(\x) + \|A\x - \b \| ^2 \). LÄS MER

4. 13. Envelopes of holomorphy for bounded holomorphic functions

   Författare :Ulf Backlund; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; holomorphicfunction; boundedholomorphic function; domain of holo¬ morphy; envelope of holomorphy; Gleason’s problem; convex set; plurisubharmonic function; pluripolar set; poly normally convex set;

   Sammanfattning : Some problems concerning holomorphic continuation of the class of bounded holo­morphic functions from bounded domains in Cn that are domains of holomorphy are solved. A bounded domain of holomorphy Ω in C2 with nonschlicht H°°-envelope of holomorphy is constructed and it is shown that there is a point in D for which Glea­son’s Problem for H°°(Ω) cannot be solved. LÄS MER

5. 14. Optimization of Maintenance Planning for Multi-Component Systems, and Primal-Dual Convergence Characterizations in Convex Optimization

   Författare :Magnus Önnheim; Göteborgs universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; subgradient methods; Lagrangian dual; primal recovery; inconsistent convex programs; ergodic sequences; maintenance scheduling; preventive maintenance; deterioration cost; deterioration cost;

   Sammanfattning : This thesis considers two topics within mathematical programming. The first topic is an investigation into the behaviour of primal-dual subgradient algorithms with primal ergodic averaging in the case where it is not known a priori whether the primal program is consistent or not. LÄS MER

7. 15. Point processes and convex sets : applications in fatigue

   Författare :Jenny Andersson; Göteborgs universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : .... LÄS MER