510 Mathematik
Filtern
Erscheinungsjahr
Dokumenttyp
- Dissertation (76)
- Habilitation (2)
- Wissenschaftlicher Artikel (1)
Schlagworte
- Optimierung (13)
- Approximationstheorie (7)
- Approximation (6)
- Funktionentheorie (6)
- Partielle Differentialgleichung (6)
- Universalität (6)
- Funktionalanalysis (5)
- universal functions (5)
- Analysis (4)
- Numerische Mathematik (4)
- Numerische Strömungssimulation (4)
- Optimale Kontrolle (4)
- Quadratische Optimierung (4)
- Shape Optimization (4)
- Gestaltoptimierung (3)
- Hadamard product (3)
- Kompositionsoperator (3)
- Navier-Stokes-Gleichung (3)
- Nichtlineare Optimierung (3)
- Operatortheorie (3)
- Parameterschätzung (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)
- Discrete optimization (2)
- Faber series (2)
- Faberreihen (2)
- GPU (2)
- Hadamard, Jacques (2)
- Hadamardprodukt (2)
- Homologische Algebra (2)
- Hyperzyklizität (2)
- Konvexe Optimierung (2)
- Laurentreihen (2)
- Maschinelles Lernen (2)
- Mathematik (2)
- Mixed-integer optimization (2)
- Monte-Carlo-Simulation (2)
- Navier-Stokes equations (2)
- Neuronales Netz (2)
- Numerical Optimization (2)
- One-Shot (2)
- POD-Methode (2)
- Parameteridentifikation (2)
- Regularisierung (2)
- Shape Spaces (2)
- Simulation (2)
- Statistik (2)
- Stochastischer Prozess (2)
- Strömungsmechanik (2)
- convergence (2)
- functional analysis (2)
- lacunary approximation (2)
- laurent series (2)
- optimal control (2)
- partial integro-differential equations (2)
- prescribed approximation curves (2)
- shape optimization (2)
- universality (2)
- universelle Funktionen (2)
- vorgegebene Approximationswege (2)
- Überkonvergenz (2)
- Adjoint (1)
- Adjoint Equation (1)
- Adjoint Method (1)
- Alternierende Projektionen (1)
- Amtliche Statistik (1)
- Analytisches Funktional (1)
- Anonymisierung (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)
- Branch-and-Bound-Methode (1)
- Branching Diffusion (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)
- Cech cohomology of leafwise constant functions (1)
- Cech-de Rham cohomology (1)
- Cesàro-Mittel (1)
- Chaotisches System (1)
- Codebuch (1)
- Column generation (1)
- Combinatorial Optimization (1)
- Common Noise (1)
- Composition algebra (1)
- Composition operator (1)
- Computational Fluid Dynamics (1)
- Computational complexity (1)
- Convergence (1)
- Coposititive, Infinite Dimension (1)
- Copositive und Vollständig positive Optimierung (1)
- Couple constraints (1)
- Césaro-Mittel (1)
- Data anonymization (1)
- Decomposition (1)
- Dekomposition (1)
- Derivat <Wertpapier> (1)
- Dichte <Stochastik> (1)
- Differentialgeometrie (1)
- Direkte numerische Simulation (1)
- Discontinuous Galerkin (1)
- Discrete Optimization, Linear Programming, Integer Programming, Extended Formulation, Graph Theory, Branch & Bound (1)
- Discrete-Time Impulse Control (1)
- Diskontinuierliche Galerkin-Methode (1)
- Diskretisierung (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)
- Dualitätstheorie (1)
- Elastizität (1)
- Electricity market equilibrium models (1)
- Entire Function (1)
- Error Estimates (1)
- Error function (1)
- Ersatzmodellierung (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)
- Ganzzahlige Optimierung (1)
- Gaussian measures (1)
- Gauß-Maß (1)
- Gebietszerlegung (1)
- Gemischt-ganzzahlige Optimierung (1)
- Gittererzeugung (1)
- Globale Konvergenz (1)
- Globale Optimierung (1)
- Graphentheorie (1)
- Graphikprozessor (1)
- Grundwasserstrom (1)
- Gärung (1)
- HPC (1)
- Hadamard cycle (1)
- Hadamardzyklus (1)
- Hassler Whitney (1)
- Hauptkomponentenanalyse (1)
- Hybrid Modelling (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)
- Laplace-Differentialgleichung (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)
- Mean Field Games (1)
- Mehrgitterverfahren (1)
- Mellin transformation (1)
- Mellin-Transformierte (1)
- Menage (1)
- Mergelyan (1)
- Mesh Generation (1)
- Mesh Quality (1)
- Methode der kleinsten Quadrate (1)
- Methode der logarithmischen Barriere (1)
- Mischung (1)
- Mittag-Leffler Funktion (1)
- Mittag-Leffler function (1)
- Mixed Local-Nonlocal PDE (1)
- Modellierung (1)
- Modellprädiktive Regelung (1)
- Modified Bessel function (1)
- Modifizierte Besselfunktion (1)
- Monte Carlo Simulation (1)
- Monte-Carlo Methods (1)
- Multilineare Algebra (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)
- Nonlocal Diffusion (1)
- Nonlocal convection-diffusion (1)
- Normalverteilung (1)
- Nullstellen (1)
- Numerisches Verfahren (1)
- Operations Research (1)
- Optimal Control on Unbounded Space Domains (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)
- PIDE constrained Optimal Control (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)
- Penalty-Methode (1)
- Perfect competition (1)
- Poisson (1)
- Polyeder (1)
- Polynom (1)
- Polynom-Interpolationsverfahren (1)
- Populationsmodellierung (1)
- Potenzialtheorie (1)
- Prediction (1)
- Projective Limit (1)
- Projektiver Limes (1)
- Proper Orthogonal Decomposition (1)
- Proximal-Punkt-Verfahren (1)
- Quantisierung (1)
- Quantisierungkugel (1)
- Quantisierungsradius (1)
- Quantization (1)
- Randverhalten (1)
- Rechteckwahrscheinlichkeit (1)
- Regression (1)
- Regressionsanalyse (1)
- Regressionsmodell (1)
- Regularisierungsverfahren (1)
- Robust optimization (1)
- Robuste Statistik (1)
- Robustheit (1)
- Rundungsfehler (1)
- Scan Statistik (1)
- Schalenkonstruktionen (1)
- Schnittebenen (1)
- Schätzfunktion (1)
- Schätztheorie (1)
- Selbst-Concordanz (1)
- Semiinfinite Optimierung (1)
- Shape Calculus (1)
- Shape Kalkül (1)
- Shape Optimiztion (1)
- Shape SQP Methods (1)
- Small area estimation (1)
- Spatial Ramsey Model (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)
- Strukturoptimierung (1)
- Subset Selection (1)
- Survey Statistics (1)
- Survey-Statistik (1)
- Taylor Shift Operator (1)
- Taylor shift operator (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)
- 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)
- 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)
- asymptotic analysis (1)
- asymptotically optimal codebooks (1)
- asymptotisch optimale Codebücher (1)
- auxiliary problem principle (1)
- binary (1)
- boundary behavior (1)
- branch-and-bound (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)
- complimentarity (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)
- de Rham cohomology (1)
- design of experiments (1)
- dilute particle suspension (1)
- domain decomposition (1)
- eigenfunction expansion (1)
- exponential type (1)
- extension operator (1)
- final set (1)
- financial derivatives (1)
- finite element method (1)
- flow control (1)
- foliated manifolds (1)
- fractional Poisson equation (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)
- incompressible Newtonian fluid (1)
- individual based model (1)
- inexact (1)
- inexact Gauss-Newton methods (1)
- k-Anonymity (1)
- kombinatorische Optimierung (1)
- komplexe Dynamik (1)
- konvexe Reforumlierungen (1)
- kopositiver Kegel (1)
- large scale problems (1)
- linear dynamics (1)
- linear elasticity (1)
- lineare Elastizität (1)
- local limit (1)
- local quantization error (1)
- logarithmic-quadratic distance function (1)
- logarithmisch-quadratische Distanzfunktion (1)
- lokaler Quantisierungsfehler (1)
- markov increment (1)
- mean field approximation (1)
- meromorphic functions (1)
- minimal compliance (1)
- minimale Nachgiebigkeit (1)
- mixing (1)
- model order reduction (1)
- model predictive control (1)
- monotone (1)
- multigrid (1)
- multilevel Toeplitz (1)
- multilinear algebra (1)
- multinomial (1)
- n.a. (1)
- nichtnegativ (1)
- non-convex (1)
- nonlinear optimization (1)
- nonnegative (1)
- normal approximation (1)
- numerical analysis (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)
- penalty (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)
- shell construction (1)
- special functions (1)
- splitting (1)
- starke und schwache Asymptotiken (1)
- statistics (1)
- stochastic Predictor-Corrector-Scheme (1)
- stochastic partial differential algebraic equation (1)
- stochastic processes (1)
- strong and weak asymptotics (1)
- structural optimization (1)
- structure-preserving (1)
- sukzessive Ableitungen (1)
- surrogate modeling (1)
- tensor methods (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 power series (1)
- universal trigonometric series (1)
- universalities (1)
- vollständig positiv (1)
- vollständig positiver Kegel (1)
- wine fermentation (1)
- zeros (1)
Institut
- Mathematik (63)
- Fachbereich 4 (15)
Das Konzept der proximalen Mehrschritt-Regularisierung (MSR) auf Folgen von Gittern bei der Lösung inkorrekter Variationsungleichungen wurde von Kaplan und Tichatschke im Jahre 1997 in ihrer Arbeit "Prox-regularization and solution of illposed elliptic variational inequalities" vorgeschlagen und theoretisch motiviert. In demselben Artikel betrachtet man ein allgemeines Problem der partiellen Regularisierung auf einem abgeschlossenen Unterraum. Als Gegenstand der Anwendung solcher Regularisierung können die schlecht gestellten Optimalsteuerprobleme heraustreten, wobei der Unterraum in dem ganzen Prozessraum durch Steuervariablen gebildet wird. Im ersten Kapitel der vorliegenden Dissertation betrachten wir ein abstraktes linear-quadratisches Kontrollproblem in allgemeinen Hilberträumen. Wir diskutieren Voraussetzungen und Bedingungen, unter denen das Kontrollproblem inkorrekt wird. Danach werden zwei allgemeine numerische Verfahren der partiellen Mehrschritt-Regularisierung formuliert. Im ersten Fall untersucht man das MSR-Verfahren, in dem die Zustandsgleichung in einen quadratischen Strafterm eingebettet wird, gemäß der entsprechenden Publikationen von Kaplan und Tichatschke. Im zweiten Fall werden die Ersatzprobleme des MSR-Verfahrens mit exakt erfüllter Zustandsgleichung entwickelt. Im Mittelpunkt sämtlicher Forschungen steht die Konvergenz der approximativen Lösungen von Ersatzproblemen des MSR-Verfahrens gegen ein Element aus der Optimalmenge des Ausgangsproblems. Es stellt sich die Frage: in welchem der genannten Fälle können schwächeren Konvergenzbedingungen für die inneren Approximationen angegeben werden? Um diese Frage aufzuklären, untersuchen wir zwei inkorrekten Kontrollproblme mit elliptischen Zustandsgleichungen und verteilter Steuerung. Das erste Problem kann auf das bekannte Fuller-Problem zurückgeführt werden, für welches eine analytische Lösung mit sogenanntem "chattering regime" existiert und welches ein Basisbeispiel für unsere Aufgaben liefert. Zur Lösung des Fuller-Problems formulieren wir einen MSR-Algorithmus, in dem man mit Fehlern des Strafverfahrens und der FEM-Approximationen rechnen muß. Als Hauptergebnis erhalten wir ein Konvergenzkriterium, das das asymptotische Verhalten von Regularisierungs-, Diskretisierungs- und Strafparametern des MSR-Algorithmus bestimmt. Im letzten Kapitel formulieren wir ein anderes schlecht gestelltes Optimalsteuerproblem mit verteilter Steuerung über dem Polygongebiet. Die Zustandsgleichung wird nun durch ein Poisson-Problem mit gemischten Randbedingungen erzeugt. Solche Aufgabenstellung liefert eine natürliche Erweiterung des auf einer gewöhnlichen Differentialgeichung beruhenden Fuller-Problems auf die Kontrollprobleme mit partiellen Differentialgleichungen. Wir formulieren neuerlich das MSR-Verfahren, in dem man neben dem Diskretisierungsfehler auch einen Berechnungsfehler berücksichtigt. Diesmal verzichten wir aber auf die Straftechniken und stellen die Ersatzprobleme mit exakt erfüllter Zustandsgleichung zusammen. Mit diesem alternativen Zugang und anhand der Falkschen Beweistechniken erhalten wir ein schwächeres und somit auch besseres Konvergenzkriterium für das MSR-Verfahren. Zum Abschluß präsentieren wir Ergebnisse der numerischen Tests, durchgeführt mit dem MSR-Verfahren für ein konkretes Optimalsteuerproblem, dessen Lösung ein zweidimensionales chattering regime aufweist.
The goal of this thesis is to transfer the logarithmic barrier approach, which led to very efficient interior-point methods for convex optimization problems in recent years, to convex semi-infinite programming problems. Based on a reformulation of the constraints into a nondifferentiable form this can be directly done for convex semi- infinite programming problems with nonempty compact sets of optimal solutions. But, by means of an involved max-term this reformulation leads to nondifferentiable barrier problems which can be solved with an extension of a bundle method of Kiwiel. This extension allows to deal with inexact objective values and subgradient information which occur due to the inexact evaluation of the maxima. Nevertheless we are able to prove similar convergence results as for the logarithmic barrier approach in the finite optimization. In the further course of the thesis the logarithmic barrier approach is coupled with the proximal point regularization technique in order to solve ill-posed convex semi-infinite programming problems too. Moreover this coupled algorithm generates sequences converging to an optimal solution of the given semi-infinite problem whereas the pure logarithmic barrier only produces sequences whose accumulation points are such optimal solutions. If there are certain additional conditions fulfilled we are further able to prove convergence rate results up to linear convergence of the iterates. Finally, besides hints for the implementation of the methods we present numerous numerical results for model examples as well as applications in finance and digital filter design.
This work is concerned with the numerical solution of optimization problems that arise in the context of ground water modeling. Both ground water hydraulic and quality management problems are considered. The considered problems are discretized problems of optimal control that are governed by discretized partial differential equations. Aspects of special interest in this work are inaccurate function evaluations and the ensuing numerical treatment within an optimization algorithm. Methods for noisy functions are appropriate for the considered practical application. Also, block preconditioners are constructed and analyzed that exploit the structure of the underlying linear system. Specifically, KKT systems are considered, and the preconditioners are tested for use within Krylov subspace methods. The project was financed by the foundation Stiftung Rheinland-Pfalz für Innovation and carried out in joint work with TGU GmbH, a company of consulting engineers for ground water and water resources.
The discretization of optimal control problems governed by partial differential equations typically leads to large-scale optimization problems. We consider flow control involving the time-dependent Navier-Stokes equations as state equation which is stamped by exactly this property. In order to avoid the difficulties of dealing with large-scale (discretized) state equations during the optimization process, a reduction of the number of state variables can be achieved by employing a reduced order modelling technique. Using the snapshot proper orthogonal decomposition method, one obtains a low-dimensional model for the computation of an approximate solution to the state equation. In fact, often a small number of POD basis functions suffices to obtain a satisfactory level of accuracy in the reduced order solution. However, the small number of degrees of freedom in a POD based reduced order model also constitutes its main weakness for optimal control purposes. Since a single reduced order model is based on the solution of the Navier-Stokes equations for a specified control, it might be an inadequate model when the control (and consequently also the actual corresponding flow behaviour) is altered, implying that the range of validity of a reduced order model, in general, is limited. Thus, it is likely to meet unreliable reduced order solutions during a control problem solution based on one single reduced order model. In order to get out of this dilemma, we propose to use a trust-region proper orthogonal decomposition (TRPOD) approach. By embedding the POD based reduced order modelling technique into a trust-region framework with general model functions, we obtain a mechanism for updating the reduced order models during the optimization process, enabling the reduced order models to represent the flow dynamics as altered by the control. In fact, a rigorous convergence theory for the TRPOD method is obtained which justifies this procedure also from a theoretical point of view. Benefiting from the trust-region philosophy, the TRPOD method guarantees to save a lot of computational work during the control problem solution, since the original state equation only has to be solved if we intend to update our model function in the trust-region framework. The optimization process itself is completely based on reduced order information only.
In this thesis we focus on the development and investigation of methods for the computation of confluent hypergeometric functions. We point out the relations between these functions and parabolic boundary value problems and demonstrate applications to models of heat transfer and fluid dynamics. For the computation of confluent hypergeometric functions on compact (real or complex) intervals we consider a series expansion based on the Hadamard product of power series. It turnes out that the partial sums of this expansion are easily computable and provide a better rate of convergence in comparison to the partial sums of the Taylor series. Regarding the computational accuracy the problem of cancellation errors is reduced considerably. Another important tool for the computation of confluent hypergeometric functions are recurrence formulae. Although easy to implement, such recurrence relations are numerically unstable e.g. due to rounding errors. In order to circumvent these problems a method for computing recurrence relations in backward direction is applied. Furthermore, asymptotic expansions for large arguments in modulus are considered. From the numerical point of view the determination of the number of terms used for the approximation is a crucial point. As an application we consider initial-boundary value problems with partial differential equations of parabolic type, where we use the method of eigenfunction expansion in order to determine an explicit form of the solution. In this case the arising eigenfunctions depend directly on the geometry of the considered domain. For certain domains with some special geometry the eigenfunctions are of confluent hypergeometric type. Both a conductive heat transfer model and an application in fluid dynamics is considered. Finally, the application of several heat transfer models to certain sterilization processes in food industry is discussed.
This work is concerned with arbitrage bounds for prices of contingent claims under transaction costs, but regardless of other conceivable market frictions. Assumptions on the underlying market are held as weak as convenient for the deduction of meaningful results that make good economic sense. In discrete time we also allow for underlying price processes with uncountable state space. In continuous time the underlying price process is modeled by a semimartingale. For the most part we could avoid any stronger assumptions. The main problems with which we deal in this work are the modelling of (proportional) transaction costs, Fundamental Theorems of Asset Pricing under transaction costs, dual characterizations of arbitrage bounds under transaction costs, Quantile-Hedging under transaction costs, alternatives to the Black-Scholes model in continuous time (under transaction costs). The results apply to stock and currency markets.
In this thesis, we study the convergence behavior of an efficient optimization method used for the identification of parameters for underdetermined systems. The research is motivated by optimization problems arising from the estimation of parameters in neural networks as well as in option pricing models. In the first application, we are concerned with neural networks used to forecasting stock market indices. Since neural networks are able to describe extremely complex nonlinear structures they are used to improve the modelling of the nonlinear dependencies occurring in the financial markets. Applying neural networks to the forecasting of economic indicators, we are confronted with a nonlinear least squares problem of large dimension. Furthermore, in this application the number of parameters of the neural network to be determined is usually much larger than the number of patterns which are available for the determination of the unknowns. Hence, the residual function of our least squares problem is underdetermined. In option pricing, an important but usually not known parameter is the volatility of the underlying asset of the option. Assuming that the underlying asset follows a one-factor continuous diffusion model with nonconstant drift and volatility term, the value of an European call option satisfies a parabolic initial value problem with the volatility function appearing in one of the coefficients of the parabolic differential equation. Using this system equation, the estimation of the volatility function is described by a nonlinear least squares problem. Since the adaption of the volatility function is based only on a small number of observed market data these problems are naturally ill-posed. For the solution of these large-scale underdetermined nonlinear least squares problems we use a fully iterative inexact Gauss-Newton algorithm. We show how the structure of a neural network as well as that of the European call price model can be exploited using iterative methods. Moreover, we present theoretical statements for the convergence of the inexact Gauss-Newton algorithm applied to the less examined case of underdetermined nonlinear least squares problems. Finally, we present numerical results for the application of neural networks to the forecasting of stock market indices as well as for the construction of the volatility function in European option pricing models. In case of the latter application, we discretize the parabolic differential equation using a finite difference scheme and we elucidate convergence problems of the discrete scheme when the initial condition is not everywhere differentiable.