Filtern
Erscheinungsjahr
Dokumenttyp
- Dissertation (44)
- Habilitation (2)
- Wissenschaftlicher Artikel (1)
Sprache
- Englisch (47) (entfernen)
Volltext vorhanden
- ja (47) (entfernen)
Schlagworte
- Optimierung (6)
- Funktionalanalysis (5)
- Partielle Differentialgleichung (5)
- Approximation (4)
- Numerische Strömungssimulation (4)
- Shape Optimization (4)
- Approximationstheorie (3)
- Funktionentheorie (3)
- Hadamard product (3)
- Kompositionsoperator (3)
- Operatortheorie (3)
- Optimale Kontrolle (3)
- Quadratische Optimierung (3)
- Sequentielle quadratische Optimierung (3)
- Universalität (3)
- proper orthogonal decomposition (3)
- Adjungierte Differentialgleichung (2)
- Aerodynamic Design (2)
- Binomialverteilung (2)
- GPU (2)
- Gestaltoptimierung (2)
- Hadamard, Jacques (2)
- Hadamardprodukt (2)
- Homologische Algebra (2)
- Hyperzyklizität (2)
- Konvexe Optimierung (2)
- Mathematik (2)
- Monte-Carlo-Simulation (2)
- Navier-Stokes equations (2)
- Navier-Stokes-Gleichung (2)
- Nichtlineare Optimierung (2)
- Numerische Mathematik (2)
- One-Shot (2)
- Parameteridentifikation (2)
- Parameterschätzung (2)
- Robust optimization (2)
- Simulation (2)
- Strömungsmechanik (2)
- Trust-Region-Algorithmus (2)
- binomial (2)
- functional analysis (2)
- optimal control (2)
- partial integro-differential equations (2)
- universality (2)
- Adjoint Equation (1)
- Adjoint Method (1)
- Allokation (1)
- Alternierende Projektionen (1)
- Analysis (1)
- Analytisches Funktional (1)
- Arbitrage-Pricing-Theorie (1)
- Ausdehnungsoperator (1)
- Auslöschung (1)
- Banach Algebras (1)
- Banach space (1)
- Banach-Algebra (1)
- Banach-Raum (1)
- Berechnungskomplexität (1)
- Berry-Esseen (1)
- Binomial (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)
- Chaotisches System (1)
- Codebuch (1)
- Combinatorial Optimization (1)
- Composition algebra (1)
- Composition operator (1)
- Computational Fluid Dynamics (1)
- Computational complexity (1)
- Convergence (1)
- Couple constraints (1)
- Decomposition (1)
- Dekomposition (1)
- Derivat <Wertpapier> (1)
- Direkte numerische Simulation (1)
- Discontinuous Galerkin (1)
- Diskontinuierliche Galerkin-Methode (1)
- Distribution (1)
- Distribution <Funktionalanalysis> (1)
- Electricity market equilibrium models (1)
- Entire Function (1)
- Error function (1)
- Ersatzmodellierung (1)
- Extensionsoperatoren (1)
- Faltungsoperator (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)
- Grundwasserstrom (1)
- Gärung (1)
- HPC (1)
- Hadamard cycle (1)
- Hadamardzyklus (1)
- Hassler Whitney (1)
- Hauptkomponentenanalyse (1)
- Hypercyclicity (1)
- Hypergeometrische Funktionen (1)
- Hypoelliptischer Operator (1)
- Individuenbasiertes Modell (1)
- Induktiver Limes (1)
- Innere-Punkte-Methode (1)
- Integrodifferentialgleichung (1)
- Intervallalgebra (1)
- Kegel (1)
- Kleinman (1)
- Kombinatorische Optimierung (1)
- Kompositionsalgebra (1)
- Konfidenzbereich (1)
- Konfluente hypergeometrische Funktion (1)
- Kontrolltheorie (1)
- Konvektions-Diffusionsgleichung (1)
- Konvergenz (1)
- Konvergenztheorie (1)
- Kriging (1)
- Krylov subspace methods (1)
- Krylov-Verfahren (1)
- LB-Algebra (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)
- Markov Inkrement (1)
- Markov-Kette (1)
- Matching (1)
- Matching polytope (1)
- Matrixcone (1)
- Matrixzerlegung (1)
- Mehrgitterverfahren (1)
- Mellin transformation (1)
- Mellin-Transformierte (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)
- Monte Carlo Simulation (1)
- Monte-Carlo Methods (1)
- Multinomial (1)
- Multiplikationssatz (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)
- Numerisches Verfahren (1)
- Optimierung bei nichtlinearen partiellen Differentialgleichungen (1)
- Optimierung unter Unsicherheiten (1)
- Optimization under Uncertainty (1)
- Optionspreis (1)
- Orthogonale Zerlegung (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)
- POD-Methode (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)
- Polyeder (1)
- Populationsmodellierung (1)
- Projective Limit (1)
- Projektiver Limes (1)
- Proximal-Punkt-Verfahren (1)
- Quantisierung (1)
- Quantisierungkugel (1)
- Quantisierungsradius (1)
- Quantization (1)
- Rechteckwahrscheinlichkeit (1)
- Regularisierung (1)
- Regularisierungsverfahren (1)
- Rundungsfehler (1)
- Scan Statistik (1)
- Schnittebenen (1)
- Selbst-Concordanz (1)
- Semiinfinite Optimierung (1)
- Shape Kalkül (1)
- Shape SQP Methods (1)
- Shape Spaces (1)
- Spektrum <Mathematik> (1)
- Splitting (1)
- Stark stetige Halbgruppe (1)
- Statistik (1)
- Stichprobe (1)
- Stochastic Differential Equation (1)
- Stochastische Approximation (1)
- Stochastische Differentialgleichungen (1)
- Stochastische Quantisierung (1)
- Stochastische optimale Kontrolle (1)
- Stochastischer Prozess (1)
- Stratified sampling (1)
- Strukturoptimierung (1)
- Survey statistics (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)
- Ultradistribut (1)
- Universal functions (1)
- Universal overconvergence (1)
- Universal power series (1)
- Universelle Funktionen (1)
- Universelle Potenzreihen (1)
- Universelle Überkonvergenz (1)
- Variationsungleichung (1)
- Versuchsplanung (1)
- Vorkonditionierung (1)
- Webbed Spaces (1)
- Weingärung (1)
- Wertpapie (1)
- Whitney jets (1)
- Whitney's extension problem (1)
- Whitneys Extensionsproblem (1)
- Windkraftwerk (1)
- alternating projections (1)
- analytic functional (1)
- asymptotically optimal codebooks (1)
- asymptotisch optimale Codebücher (1)
- auxiliary problem principle (1)
- bundle-method (1)
- combinatorial optimization (1)
- completely positive (1)
- completely positive cone (1)
- complex dynamics (1)
- complexity reduction (1)
- composition operator (1)
- computational fluid dynamics (1)
- confidence region (1)
- confluent hypergeometric function (1)
- convergence (1)
- convergence theory (1)
- convolution operator (1)
- copositive cone (1)
- cutting planes (1)
- design of experiments (1)
- domain decomposition (1)
- eigenfunction expansion (1)
- extension operator (1)
- financial derivatives (1)
- flow control (1)
- ganze Funktion (1)
- gewöhnliche Differentialgleichungen (1)
- homological algebra (1)
- homological methods (1)
- homologische Methoden (1)
- hypercyclicity (1)
- hypergeometric functions (1)
- individual based model (1)
- inexact (1)
- inexact Gauss-Newton methods (1)
- kombinatorische Optimierung (1)
- komplexe Dynamik (1)
- konvexe Reforumlierungen (1)
- kopositiver Kegel (1)
- lacunary approximation (1)
- large scale problems (1)
- linear dynamics (1)
- local quantization error (1)
- logarithmic-quadratic distance function (1)
- logarithmisch-quadratische Distanzfunktion (1)
- lokaler Quantisierungsfehler (1)
- markov increment (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)
- 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)
- rectangular probabilities (1)
- reduced order modelling (1)
- reduced-order modelling (1)
- scan statistics (1)
- second order cone (1)
- self-concodrance (1)
- series expansion (1)
- shape calculus (1)
- shape optimization (1)
- splitting (1)
- statistics (1)
- stochastic Predictor-Corrector-Scheme (1)
- structural optimization (1)
- structure-preserving (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)
- vollständig positiv (1)
- vollständig positiver Kegel (1)
- wine fermentation (1)
- Überkonvergenz (1)
Institut
- Mathematik (47) (entfernen)
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.
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.
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.
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 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.