Filtern
Erscheinungsjahr
Dokumenttyp
- Dissertation (62)
- Habilitation (2)
- Wissenschaftlicher Artikel (1)
Schlagworte
- Optimierung (7)
- Approximation (6)
- Approximationstheorie (6)
- Funktionentheorie (6)
- Partielle Differentialgleichung (6)
- Universalität (6)
- Funktionalanalysis (5)
- universal functions (5)
- Numerische Strömungssimulation (4)
- Optimale Kontrolle (4)
- Quadratische Optimierung (4)
- Shape Optimization (4)
- Analysis (3)
- Hadamard product (3)
- Kompositionsoperator (3)
- Numerische Mathematik (3)
- Operatortheorie (3)
- Sequentielle quadratische Optimierung (3)
- Trust-Region-Algorithmus (3)
- Universelle Funktionen (3)
- binomial (3)
- proper orthogonal decomposition (3)
- Adjungierte Differentialgleichung (2)
- Aerodynamic Design (2)
- Approximation im Komplexen (2)
- Baire's theorem (2)
- Binomial (2)
- Binomialverteilung (2)
- Dichtesatz (2)
- Faber series (2)
- Faberreihen (2)
- GPU (2)
- Gestaltoptimierung (2)
- Hadamard, Jacques (2)
- Hadamardprodukt (2)
- Homologische Algebra (2)
- Hyperzyklizität (2)
- Konvexe Optimierung (2)
- Laurentreihen (2)
- Mathematik (2)
- Monte-Carlo-Simulation (2)
- Navier-Stokes equations (2)
- Navier-Stokes-Gleichung (2)
- Nichtlineare Optimierung (2)
- One-Shot (2)
- POD-Methode (2)
- Parameteridentifikation (2)
- Parameterschätzung (2)
- Regularisierung (2)
- Robust optimization (2)
- Simulation (2)
- Statistik (2)
- Stochastischer Prozess (2)
- Strömungsmechanik (2)
- convergence (2)
- functional analysis (2)
- laurent series (2)
- optimal control (2)
- partial integro-differential equations (2)
- prescribed approximation curves (2)
- universality (2)
- universelle Funktionen (2)
- vorgegebene Approximationswege (2)
- Überkonvergenz (2)
- Adjoint (1)
- Adjoint Equation (1)
- Adjoint Method (1)
- Allokation (1)
- Alternierende Projektionen (1)
- Analytisches Funktional (1)
- Arbitrage-Pricing-Theorie (1)
- Asymptotik (1)
- Ausdehnungsoperator (1)
- Auslöschung (1)
- Banach Algebras (1)
- Banach space (1)
- Banach-Algebra (1)
- Banach-Raum (1)
- Berechnungskomplexität (1)
- Berry-Esseen (1)
- Birkhoff functions (1)
- Birkhoff-Funktionen (1)
- Borel transform (1)
- Bregman distance (1)
- Bregman-Distanz (1)
- Brownian Motion (1)
- Brownsche Bewegung (1)
- Buehler, Robert J. (1)
- Bündel-Methode (1)
- Calibration (1)
- Cancellation (1)
- Cesàro-Mittel (1)
- Chaotisches System (1)
- Codebuch (1)
- Combinatorial Optimization (1)
- Composition algebra (1)
- Composition operator (1)
- Computational Fluid Dynamics (1)
- Computational complexity (1)
- Convergence (1)
- Copositive und Vollständig positive Optimierung (1)
- Couple constraints (1)
- Cross-Border-Leasing (1)
- Césaro-Mittel (1)
- Decomposition (1)
- Dekomposition (1)
- Derivat <Wertpapier> (1)
- Dichte <Stochastik> (1)
- Direkte numerische Simulation (1)
- Discontinuous Galerkin (1)
- Diskontinuierliche Galerkin-Methode (1)
- Distribution (1)
- Distribution <Funktionalanalysis> (1)
- Doppelt nichtzentrale F-Verteilung (1)
- Doppelt nichtzentrale t-Verteilung (1)
- Doubly noncentral F-distribution (1)
- Doubly noncentral t-distribution (1)
- Downside Risk (1)
- Downside-Risiko (1)
- Dualitätstheorie (1)
- Elastizität (1)
- Electricity market equilibrium models (1)
- Entire Function (1)
- Error Estimates (1)
- Error function (1)
- Ersatzmodellierung (1)
- Expected Shortfall (1)
- Extended sign regular (1)
- Extensionsoperatoren (1)
- Faltungsoperator (1)
- Fehlerabschätzung (1)
- Fehleranalyse (1)
- Fehlerfunktion (1)
- Finanzmathematik (1)
- Fledermäuse (1)
- Formenräume (1)
- Formoptimierung (1)
- Fréchet-Algebra (1)
- Functor (1)
- Funktor (1)
- Gaussian measures (1)
- Gauß-Maß (1)
- Gebietszerlegung (1)
- Gittererzeugung (1)
- Globale Konvergenz (1)
- Globale Optimierung (1)
- Graphentheorie (1)
- Graphikprozessor (1)
- Grenzüberschreitendes Leasing (1)
- Grundwasserstrom (1)
- Gärung (1)
- HPC (1)
- Hadamard cycle (1)
- Hadamardzyklus (1)
- Hassler Whitney (1)
- Hauptkomponentenanalyse (1)
- Hypercyclicity (1)
- Hypergeometric 3-F-1 Polynomials (1)
- Hypergeometrische 3-F-1 Polynome (1)
- Hypergeometrische Funktionen (1)
- Hypoelliptischer Operator (1)
- Individuenbasiertes Modell (1)
- Induktiver Limes (1)
- Inkorrekt gestelltes Problem (1)
- Innere-Punkte-Methode (1)
- Integer Optimization (1)
- Integrodifferentialgleichung (1)
- Intervallalgebra (1)
- Kegel (1)
- Kleinman (1)
- Kombinatorische Optimierung (1)
- Komplexe Approximation (1)
- Kompositionsalgebra (1)
- Konfidenzbereich (1)
- Konfidenzintervall (1)
- Konfidenzintervalle (1)
- Konfluente hypergeometrische Funktion (1)
- Kontrolltheorie (1)
- Konvektions-Diffusionsgleichung (1)
- Konvergenz (1)
- Konvergenztheorie (1)
- Korovkin-Satz (1)
- Kriging (1)
- Krylov subspace methods (1)
- Krylov-Verfahren (1)
- LB-Algebra (1)
- Laplace Method (1)
- Laplace Methode (1)
- Level Set Methode (1)
- Level constraints (1)
- Linear complementarity problems (1)
- Lineare Dynamik (1)
- Lineare Funktionalanalysis (1)
- Linearer partieller Differentialoperator (1)
- Lückenapproximation (1)
- Lückenreihe (1)
- Markov Inkrement (1)
- Markov-Kette (1)
- Matching (1)
- Matching polytope (1)
- Matrixcone (1)
- Matrixzerlegung (1)
- Mehrgitterverfahren (1)
- Mellin transformation (1)
- Mellin-Transformierte (1)
- Menage (1)
- Mesh Generation (1)
- Methode der kleinsten Quadrate (1)
- Methode der logarithmischen Barriere (1)
- Mischung (1)
- Mittag-Leffler Funktion (1)
- Mittag-Leffler function (1)
- Modellprädiktive Regelung (1)
- Modified Bessel function (1)
- Modifizierte Besselfunktion (1)
- Monte Carlo Simulation (1)
- Monte-Carlo Methods (1)
- Multinomial (1)
- Multiplikationssatz (1)
- Ménage Polynome (1)
- Ménage Polynomials (1)
- Nash–Cournot competition (1)
- Nebenbedingung (1)
- Newton (1)
- Newton-Verfahren (1)
- Nichtfortsetzbare Potenzreihe (1)
- Nichtglatte Optimierung (1)
- Nichtkonvexe Optimierung (1)
- Nonlinear Optimization (1)
- Normalverteilung (1)
- Nullstellen (1)
- Numerical Optimization (1)
- Numerisches Verfahren (1)
- Optimierung bei nichtlinearen partiellen Differentialgleichungen (1)
- Optimierung unter Unsicherheiten (1)
- Optimization under Uncertainty (1)
- Optionspreis (1)
- Orthogonale Zerlegung (1)
- Overconvergence (1)
- Overconvergent power series and matrix-transforms (1)
- P-Konvexität für Träger (1)
- P-Konvexität für singuläre Träger (1)
- P-convexity for singular supports (1)
- P-convexity for supports (1)
- PDE Beschränkungen (1)
- PDE Constraints (1)
- PDE-constrained optimization (1)
- Parameter dependence of solutions of linear partial differential equations (1)
- Parameterabhängige Lösungen linearer partieller Differentialgeichungen (1)
- Parameterabhängigkeit (1)
- Parametrische Optimierung (1)
- Perfect competition (1)
- Poisson (1)
- Polyeder (1)
- Polynom (1)
- Polynom-Interpolationsverfahren (1)
- Populationsmodellierung (1)
- Potenzialtheorie (1)
- Projective Limit (1)
- Projektiver Limes (1)
- Proper Orthogonal Decomposition (1)
- Proximal-Punkt-Verfahren (1)
- Public Sector Financing (1)
- Quantisierung (1)
- Quantisierungkugel (1)
- Quantisierungsradius (1)
- Quantization (1)
- Randverhalten (1)
- Rechteckwahrscheinlichkeit (1)
- Regularisierungsverfahren (1)
- Robustheit (1)
- Rundungsfehler (1)
- Scan Statistik (1)
- Schalenkonstruktionen (1)
- Schnittebenen (1)
- Selbst-Concordanz (1)
- Semiinfinite Optimierung (1)
- Shape Kalkül (1)
- Shape SQP Methods (1)
- Shape Spaces (1)
- Spektrum <Mathematik> (1)
- Spezielle Funktionen (1)
- Splitting (1)
- Stark stetige Halbgruppe (1)
- Stichprobe (1)
- Stochastic Differential Equation (1)
- Stochastische Approximation (1)
- Stochastische Differentialgleichungen (1)
- Stochastische Konvergenz (1)
- Stochastische Quantisierung (1)
- Stochastische optimale Kontrolle (1)
- Stratified sampling (1)
- Strukturoptimierung (1)
- Survey Statistics (1)
- Survey statistics (1)
- Survey-Statistik (1)
- Taylor Shift Operator (1)
- Taylor shift operator (1)
- Theorie (1)
- Topological Algebra (1)
- Topologieoptimierung (1)
- Topologische Algebra (1)
- Topologische Algebra mit Gewebe (1)
- Topologische Sensitivität (1)
- Transaktionskosten (1)
- Transitivität (1)
- Trust Region (1)
- US-Lease (1)
- Ueberkonvergenz (1)
- Ultradistribut (1)
- Unimodality (1)
- Unimodalität (1)
- Universal approximation (1)
- Universal functions (1)
- Universal overconvergence (1)
- Universal power series (1)
- Universalitäten (1)
- Universelle Approximation (1)
- Universelle Funktion (1)
- Universelle Potenzreihen (1)
- Universelle trigonometrische Reihe (1)
- Universelle ueberkonvergente Potenzreihen und Matrix-Transformierte (1)
- Universelle Überkonvergenz (1)
- Value-at-Risk (1)
- Variationsungleichung (1)
- Versuchsplanung (1)
- Verteilungsapproximation (1)
- Volkszählung (1)
- Vorkonditionierung (1)
- Vorzeichenreguläre Funktionen (1)
- Wahrscheinlichkeitsverteilung (1)
- Webbed Spaces (1)
- Weingärung (1)
- Wertpapie (1)
- Whitney jets (1)
- Whitney's extension problem (1)
- Whitneys Extensionsproblem (1)
- Windkraftwerk (1)
- Zwillingsformel (1)
- alternating projections (1)
- amarts (1)
- analytic functional (1)
- approximation (1)
- approximation in the complex plane (1)
- asymptotically optimal codebooks (1)
- asymptotisch optimale Codebücher (1)
- auxiliary problem principle (1)
- boundary behavior (1)
- bundle-method (1)
- combinatorial optimization (1)
- completely positive (1)
- completely positive cone (1)
- completely positive modelling and optimization (1)
- complex analysis (1)
- complex approximation (1)
- complex dynamics (1)
- complexity reduction (1)
- composition operator (1)
- computational fluid dynamics (1)
- confidence intervals (1)
- confidence region (1)
- confluent hypergeometric function (1)
- convergence theory (1)
- convolution operator (1)
- copositive cone (1)
- copositive optimization (1)
- cutting planes (1)
- design of experiments (1)
- domain decomposition (1)
- eigenfunction expansion (1)
- exponential type (1)
- extension operator (1)
- final set (1)
- financial derivatives (1)
- flow control (1)
- frequently hypercyclic operator (1)
- ganze Funktion (1)
- gap power series (1)
- gewöhnliche Differentialgleichungen (1)
- growth (1)
- homological algebra (1)
- homological methods (1)
- homologische Methoden (1)
- hypercyclic operator (1)
- hypercyclicity (1)
- hypergeometric functions (1)
- individual based model (1)
- inexact (1)
- inexact Gauss-Newton methods (1)
- kombinatorische Optimierung (1)
- kommunales Sonderfinanzierungsinstrument (1)
- komplexe Dynamik (1)
- konvexe Reforumlierungen (1)
- kopositiver Kegel (1)
- lacunary approximation (1)
- large scale problems (1)
- linear dynamics (1)
- linear elasticity (1)
- lineare Elastizität (1)
- local quantization error (1)
- logarithmic-quadratic distance function (1)
- logarithmisch-quadratische Distanzfunktion (1)
- lokaler Quantisierungsfehler (1)
- markov increment (1)
- meromorphic functions (1)
- minimal compliance (1)
- minimale Nachgiebigkeit (1)
- mixing (1)
- model order reduction (1)
- model predictive control (1)
- monotone (1)
- multigrid (1)
- multinomial (1)
- n.a. (1)
- nichtnegativ (1)
- nonnegative (1)
- normal approximation (1)
- optimal continuity estimates (1)
- optimal quantization (1)
- optimale Quantisierung (1)
- optimale Stetigkeitsabschätzungen (1)
- optimization (1)
- ordinary differential equations (1)
- orthotrope Materialien (1)
- orthotropic material (1)
- parameter dependence (1)
- parameter estimation (1)
- parameter identification (1)
- partial differential equations (1)
- partial differential operators of first order as generators of C0-semigroups (1)
- partial integro-differential equation (1)
- partielle Differentialgleichungen (1)
- partielle Differentialoperatoren erster Ordnung als Erzeuger von C0-Halbgruppen (1)
- partielle Integro Differentialgleichung (1)
- partielle Integro-Differentialgleichungen (1)
- partielle Integrodifferentialgleichungen (1)
- population modelling (1)
- port-Hamiltonian (1)
- preconditioning (1)
- pricing (1)
- principal component analysis (1)
- quantization ball (1)
- quantization radius (1)
- rationale und meromorphe Approximation (1)
- rectangular probabilities (1)
- reduced order modelling (1)
- reduced-order modelling (1)
- robustness (1)
- scan statistics (1)
- second order cone (1)
- self-concodrance (1)
- series expansion (1)
- shape calculus (1)
- shape optimization (1)
- shell construction (1)
- special functions (1)
- splitting (1)
- starke und schwache Asymptotiken (1)
- statistics (1)
- stochastic Predictor-Corrector-Scheme (1)
- stochastic processes (1)
- strong and weak asymptotics (1)
- structural optimization (1)
- structure-preserving (1)
- sukzessive Ableitungen (1)
- surrogate modeling (1)
- topological derivative (1)
- topology optimization (1)
- transaction costs (1)
- transitivity (1)
- trust-region method (1)
- trust-region methods (1)
- underdetermined nonlinear least squares problem (1)
- universal (1)
- universal trigonometric series (1)
- universalities (1)
- vollständig positiv (1)
- vollständig positiver Kegel (1)
- wine fermentation (1)
- zeros (1)
Institut
- Mathematik (65) (entfernen)
A matrix A is called completely positive if there exists an entrywise nonnegative matrix B such that A = BB^T. These matrices can be used to obtain convex reformulations of for example nonconvex quadratic or combinatorial problems. One of the main problems with completely positive matrices is checking whether a given matrix is completely positive. This is known to be NP-hard in general. rnrnFor a given matrix completely positive matrix A, it is nontrivial to find a cp-factorization A=BB^T with nonnegative B since this factorization would provide a certificate for the matrix to be completely positive. But this factorization is not only important for the membership to the completely positive cone, it can also be used to recover the solution of the underlying quadratic or combinatorial problem. In addition, it is not a priori known how many columns are necessary to generate a cp-factorization for the given matrix. The minimal possible number of columns is called the cp-rank of A and so far it is still an open question how to derive the cp-rank for a given matrix. Some facts on completely positive matrices and the cp-rank will be given in Chapter 2. Moreover, in Chapter 6, we will see a factorization algorithm, which, for a given completely positive matrix A and a suitable starting point, computes the nonnegative factorization A=BB^T. The algorithm therefore returns a certificate for the matrix to be completely positive. As introduced in Chapter 3, the fundamental idea of the factorization algorithm is to start from an initial square factorization which is not necessarily entrywise nonnegative, and extend this factorization to a matrix for which the number of columns is greater than or equal to the cp-rank of A. Then it is the goal to transform this generated factorization into a cp-factorization. This problem can be formulated as a nonconvex feasibility problem, as shown in Section 4.1, and solved by a method which is based on alternating projections, as proven in Chapter 6. On the topic of alternating projections, a survey will be given in Chapter 5. Here we will see how to apply this technique to several types of sets like subspaces, convex sets, manifolds and semialgebraic sets. Furthermore, we will see some known facts on the convergence rate for alternating projections between these types of sets. Considering more than two sets yields the so called cyclic projections approach. Here some known facts for subspaces and convex sets will be shown. Moreover, we will see a new convergence result on cyclic projections among a sequence of manifolds in Section 5.4. In the context of cp-factorizations, a local convergence result for the introduced algorithm will be given. This result is based on the known convergence for alternating projections between semialgebraic sets. To obtain cp-facrorizations with this first method, it is necessary to solve a second order cone problem in every projection step, which is very costly. Therefore, in Section 6.2, we will see an additional heuristic extension, which improves the numerical performance of the algorithm. Extensive numerical tests in Chapter 7 will show that the factorization method is very fast in most instances. In addition, we will see how to derive a certificate for the matrix to be an element of the interior of the completely positive cone. As a further application, this method can be extended to find a symmetric nonnegative matrix factorization, where we consider an additional low-rank constraint. Here again, the method to derive factorizations for completely positive matrices can be used, albeit with some further adjustments, introduced in Section 8.1. Moreover, we will see that even for the general case of deriving a nonnegative matrix factorization for a given rectangular matrix A, the key aspects of the completely positive factorization approach can be used. To this end, it becomes necessary to extend the idea of finding a completely positive factorization such that it can be used for rectangular matrices. This yields an applicable algorithm for nonnegative matrix factorization in Section 8.2. Numerical results for this approach will suggest that the presented algorithms and techniques to obtain completely positive matrix factorizations can be extended to general nonnegative factorization problems.
In this thesis, we present a new approach for estimating the effects of wind turbines for a local bat population. We build an individual based model (IBM) which simulates the movement behaviour of every single bat of the population with its own preferences, foraging behaviour and other species characteristics. This behaviour is normalized by a Monte-Carlo simulation which gives us the average behaviour of the population. The result is an occurrence map of the considered habitat which tells us how often the bat and therefore the considered bat population frequent every region of this habitat. Hence, it is possible to estimate the crossing rate of the position of an existing or potential wind turbine. We compare this individual based approach with a partial differential equation based method. This second approach produces a lower computational effort but, unfortunately, we lose information about the movement trajectories at the same time. Additionally, the PDE based model only gives us a density profile. Hence, we lose the information how often each bat crosses special points in the habitat in one night. In a next step we predict the average number of fatalities for each wind turbine in the habitat, depending on the type of the wind turbine and the behaviour of the considered bat species. This gives us the extra mortality caused by the wind turbines for the local population. This value is used for a population model and finally we can calculate whether the population still grows or if there already is a decline in population size which leads to the extinction of the population. Using the combination of all these models, we are able to evaluate the conflict of wind turbines and bats and to predict the result of this conflict. Furthermore, it is possible to find better positions for wind turbines such that the local bat population has a better chance to survive. Since bats tend to move in swarm formations under certain circumstances, we introduce swarm simulation using partial integro-differential equations. Thereby, we have a closer look at existence and uniqueness properties of solutions.
In this thesis, we aim to study the sampling allocation problem of survey statistics under uncertainty. We know that the stratum specific variances are generally not known precisely and we have no information about the distribution of uncertainty. The cost of interviewing each person in a stratum is also a highly uncertain parameter as sometimes people are unavailable for the interview. We propose robust allocations to deal with the uncertainty in both stratum specific variances and costs. However, in real life situations, we can face such cases when only one of the variances or costs is uncertain. So we propose three different robust formulations representing these different cases. To the best of our knowledge robust allocation in the sampling allocation problem has not been considered so far in any research.
The first robust formulation for linear problems was proposed by Soyster (1973). Bertsimas and Sim (2004) proposed a less conservative robust formulation for linear problems. We study these formulations and extend them for the nonlinear sampling allocation problem. It is very unlikely to happen that all of the stratum specific variances and costs are uncertain. So the robust formulations are in such a way that we can select how many strata are uncertain which we refer to as the level of uncertainty. We prove that an upper bound on the probability of violation of the nonlinear constraints can be calculated before solving the robust optimization problem. We consider various kinds of datasets and compute robust allocations. We perform multiple experiments to check the quality of the robust allocations and compare them with the existing allocation techniques.
In this thesis we study structure-preserving model reduction methods for the efficient and reliable approximation of dynamical systems. A major focus is the approximation of a nonlinear flow problem on networks, which can, e.g., be used to describe gas network systems. Our proposed approximation framework guarantees so-called port-Hamiltonian structure and is general enough to be realizable by projection-based model order reduction combined with complexity reduction. We divide the discussion of the flow problem into two parts, one concerned with the linear damped wave equation and the other one with the general nonlinear flow problem on networks.
The study around the linear damped wave equation relies on a Galerkin framework, which allows for convenient network generalizations. Notable contributions of this part are the profound analysis of the algebraic setting after space-discretization in relation to the infinite dimensional setting and its implications for model reduction. In particular, this includes the discussion of differential-algebraic structures associated to the network-character of our problem and the derivation of compatibility conditions related to fundamental physical properties. Amongst the different model reduction techniques, we consider the moment matching method to be a particularly well-suited choice in our framework.
The Galerkin framework is then appropriately extended to our general nonlinear flow problem. Crucial supplementary concepts are required for the analysis, such as the partial Legendre transform and a more careful discussion of the underlying energy-based modeling. The preservation of the port-Hamiltonian structure after the model-order- and complexity-reduction-step represents a major focus of this work. Similar as in the analysis of the model order reduction, compatibility conditions play a crucial role in the analysis of our complexity reduction, which relies on a quadrature-type ansatz. Furthermore, energy-stable time-discretization schemes are derived for our port-Hamiltonian approximations, as structure-preserving methods from literature are not applicable due to our rather unconventional parametrization of the solution.
Apart from the port-Hamiltonian approximation of the flow problem, another topic of this thesis is the derivation of a new extension of moment matching methods from linear systems to quadratic-bilinear systems. Most system-theoretic reduction methods for nonlinear systems rely on multivariate frequency representations. Our approach instead uses univariate frequency representations tailored towards user-defined families of inputs. Then moment matching corresponds to a one-dimensional interpolation problem rather than to a multi-dimensional interpolation as for the multivariate approaches, i.e., it involves fewer interpolation frequencies to be chosen. The notion of signal-generator-driven systems, variational expansions of the resulting autonomous systems as well as the derivation of convenient tensor-structured approximation conditions are the main ingredients of this part. Notably, our approach allows for the incorporation of general input relations in the state equations, not only affine-linear ones as in existing system-theoretic methods.
This paper mainly studies two topics: linear complementarity problems for modeling electricity market equilibria and optimization under uncertainty. We consider both perfectly competitive and Nash–Cournot models of electricity markets and study their robustifications using strict robustness and the -approach. For three out of the four combinations of economic competition and robustification, we derive algorithmically tractable convex optimization counterparts that have a clear-cut economic interpretation. In the case of perfect competition, this result corresponds to the two classic welfare theorems, which also apply in both considered robust cases that again yield convex robustified problems. Using the mentioned counterparts, we can also prove the existence and, in some cases, uniqueness of robust equilibria. Surprisingly, it turns out that there is no such economic sensible counterpart for the case of -robustifications of Nash–Cournot models. Thus, an analog of the welfare theorems does not hold in this case. Finally, we provide a computational case study that illustrates the different effects of the combination of economic competition and uncertainty modeling.