Refine
Has Fulltext
- yes (109)
Is part of the Bibliography
- yes (109)
Year of publication
Document Type
- Doctoral Thesis (109) (remove)
Language
- English (109) (remove)
Keywords
- Optimale Kontrolle (11)
- Optimierung (8)
- Nash-Gleichgewicht (7)
- Extremwertstatistik (6)
- Newton-Verfahren (6)
- Nichtlineare Optimierung (5)
- optimal control (5)
- Extremwerttheorie (4)
- Nichtglatte Optimierung (4)
- A-priori-Wissen (3)
- Copula (3)
- Differentialgeometrie (3)
- Differentialgleichung (3)
- Elliptische Differentialgleichung (3)
- Euler equations (3)
- Galerkin-Methode (3)
- Konfidenzintervall (3)
- MPEC (3)
- Magnetoelastizität (3)
- Monodromie (3)
- Nichtkonvexe Optimierung (3)
- Pareto-Verteilung (3)
- Partielle Differentialgleichung (3)
- Spieltheorie (3)
- Stabilität (3)
- Zetafunktion (3)
- Audit sampling (2)
- Belyi map (2)
- Biholomorphe Abbildung (2)
- Binomialverteilung (2)
- Controllability (2)
- D-Norm (2)
- Darstellungsmatrix (2)
- Deformationsquantisierung (2)
- Dirichlet-Reihe (2)
- Eigenwert (2)
- Extreme Value Theory (2)
- Finanzmathematik (2)
- Finite-Elemente-Methode (2)
- Finite-Volumen-Methode (2)
- Fokker-Planck-Gleichung (2)
- Galois-Theorie (2)
- Gamma-Konvergenz (2)
- Generalized Nash Equilibrium Problem (2)
- Gleichverteilung (2)
- Homogener Raum (2)
- Hurwitz-Raum (2)
- Kohomologie (2)
- Kombinatorik (2)
- Kompakte Lie-Gruppe (2)
- Komplementaritätsproblem (2)
- Kontrolltheorie (2)
- Kopula <Mathematik> (2)
- Ljapunov-Funktion (2)
- Ljapunov-Stabilitätstheorie (2)
- Loewner theory (2)
- Loewner-Theorie (2)
- Mathematik (2)
- Mehrgitterverfahren (2)
- Mikromagnetismus (2)
- Newton Methods (2)
- Nichtlineare Kontrolltheorie (2)
- Nikaido-Isoda function (2)
- Numerical analysis (2)
- Numerisches Verfahren (2)
- Optimale Steuerung (2)
- PDE (2)
- Pontryagin maximum principle (2)
- Prediction interval (2)
- Prior information (2)
- Riemannsche Zetafunktion (2)
- Schlichte Funktion (2)
- Simulation (2)
- Stability (2)
- Stochastischer Prozess (2)
- Systemisches Risiko (2)
- Verallgemeinertes Nash-Gleichgewichtsproblem (2)
- Zahlentheorie (2)
- deformation quantization (2)
- extreme value theory (2)
- fast vollständig zerlegbare Gruppe (2)
- finite elements (2)
- multigrid (2)
- optimization (2)
- prime number (2)
- representing matrix (2)
- Überlagerung <Mathematik> (2)
- (0 (1)
- *-algebra (1)
- 1)-Matrix (1)
- 1)-matrix (1)
- 1655-1705> (1)
- ADMM (1)
- Abbildungseigenschaften (1)
- Abelsche Gruppe (1)
- Abhängigkeitsmaß (1)
- Abstiegsverfahren (1)
- Abstoßungsphänomen (1)
- Acoustic equations (1)
- Adolf Hurwitz (1)
- Affine Skalierungsverfahren (1)
- Aggregation (1)
- Algebraic Curves (1)
- Algebraic signal processing (1)
- Algebraische Kurve (1)
- Algebraische Signalverarbeitung (1)
- Algebraische Zahlentheorie (1)
- Algebraischer Funktionenkörper (1)
- Analytische Zahlentheorie (1)
- Angewandte Geowissenschaften (1)
- Angular Density (1)
- Anpassungstest (1)
- Approximation (1)
- Arbitrary Lagrangian-Eulerian (1)
- Archimedean copula (1)
- Argumentation (1)
- Asymptotic Preserving (1)
- Asymptotic independence (1)
- Atmosphäre (1)
- Augmented Lagrangian (1)
- Augmented Lagrangian methods (1)
- Automorphismengruppe (1)
- Banach-Raum (1)
- Beatty sequence (1)
- Bedingte Unabhängigkeit (1)
- Belyi-Funktionen (1)
- Beobachter (1)
- Bernoulli (1)
- Bernoulli Raum (1)
- Bernoulli Space (1)
- Beweistheorie (1)
- Bildrekonstruktion (1)
- Bilinear differential games (1)
- Blinear Quantum Control Systems (1)
- Box-Restriktionen (1)
- Bregman distance (1)
- Brittle fracture (1)
- Brüder Hurwitz (1)
- Burgers-Gleichung (1)
- CSIDH (1)
- Calculus of Variations (1)
- Calculus of variations (1)
- Carbon dioxide capture (1)
- Cardinality Constraints (1)
- Cayley graph (1)
- Charakteranalyse (1)
- Coisotropic reduction (1)
- Complex Continued Fractions (1)
- Composite optimization problems (1)
- Compressed Sensing (1)
- Confidence interval (1)
- Confidence intervals (1)
- Conformal Metrics (1)
- Conjugate function (1)
- Conjugate gradient method (1)
- Conservation Laws (1)
- Constrained optimization (1)
- Constraint-Programmierung (1)
- Continuous Sample Path (1)
- Copula <Mathematik> (1)
- Counterparty Risk (1)
- Credibility interval (1)
- Curvature Equation (1)
- D-Norms (1)
- DC optimization (1)
- Darstellung vonPseudo-Metriken (1)
- Data Exploration (1)
- Dichtefunktionalformalismus (1)
- Differential Games (1)
- Differentialgleichungssystem (1)
- Digitale Signalverarbeitung (1)
- Dimension reduction (1)
- Diophantine approximation (1)
- Discontinuous Galerkin method (1)
- Discrete to continuum (1)
- Diskrepanz (1)
- Dual gap function (1)
- Dualitätstheorie (1)
- Dynamic Geometry Environment (1)
- Dynamical Systems (1)
- Dynamical system (1)
- Dynamische Geometriesysteme (1)
- Dynamische Optimierung (1)
- Dynamisches System (1)
- E-Learning (1)
- Eigenmode (1)
- Elliptic equations (1)
- Elliptische Kurve (1)
- Endliche Geometrie (1)
- Ensemble optimal control (1)
- Entropiebedingung (1)
- Entropielösung (1)
- Entropy admissibility condition (1)
- Epstein zeta-function (1)
- Epstein, Paul (1)
- Erhaltungsgleichungen (1)
- Estimation (1)
- Eulersche Differentialgleichung (1)
- Exact-controllability (1)
- Exceedance Stability (1)
- Existenz schwacher Lösungen (1)
- Existenz und Eindeutigkeit (1)
- Explicit Computation (1)
- Explizite Berechnung (1)
- Exponential smoothing (1)
- Exponential smoothing with covariates (1)
- Extreme value copula (1)
- Extremwertregelung (1)
- Extremwertverteilung (1)
- Faltungscode (1)
- Fast vollständig zerlegbare Gruppe (1)
- Fermentation (1)
- Financial Networks (1)
- Finanzielle Netzwerke (1)
- Finite Elemente (1)
- Finite support distributions (1)
- Firmwert (1)
- Fixpunktsatz (1)
- Fluid (1)
- Fluid-Partikel-Strömung (1)
- Fluid-Struktur-Wechselwirkung (1)
- Fluid-structure interaction (1)
- Fluidnetzwerk (1)
- Flüssigkristall (1)
- Fokalmannigfaltigkeit (1)
- Fokker-Planck (1)
- Fokker-Planck optimality systems (1)
- Formoptimierung (1)
- Fragility Index (1)
- Fragilitätsindex (1)
- Freies Randwertproblem (1)
- Function Fields (1)
- Functional differential equations (1)
- Functions with Primitive (1)
- Funktion von beschränkter Variation (1)
- Funktionen mit Stammfunktion (1)
- Funktionenkörper (1)
- Funktionentheorie (1)
- GPD (1)
- GPD-Flow (1)
- Galois theory (1)
- Galois-Erweiterung (1)
- Galois-Feld (1)
- Galoistheorie (1)
- Gasgemisch (1)
- Gebäude (1)
- Generalized Nash Equilibrium (1)
- Generalized Nash equilibrium (1)
- Generalized Pareto Distribution (1)
- Generalized Pareto copula (1)
- Geometric constraints (1)
- Gestaltoptimierung (1)
- Gleichmäßige Konvergenz (1)
- Gleichungssysteme (1)
- Globale Analysis (1)
- Goodness-of-Fit Test (1)
- Graph (1)
- Graph spectrum (1)
- Grassmann Manifold (1)
- Grassmann-Mannigfaltigkeit (1)
- Gravitationsfeld (1)
- Guignard CQ (1)
- HDL (1)
- Hamilton Systeme (1)
- Hamilton Sytstems (1)
- Hamilton-Jacobi-Differentialgleichung (1)
- Hierarchische Matrix (1)
- Hilbert-Raum (1)
- Hilfe-System (1)
- Homicidal Chauffeur game (1)
- Homogenisierung <Mathematik> (1)
- Homologische Algebra (1)
- Hurwitz spaces (1)
- Hybrid Dynamical Systems (1)
- Hybridsystem (1)
- Hydrodynamische Grenzwerte (1)
- Hyperbolic Partial Differential Equations (1)
- Hyperbolische Differentialgleichung (1)
- Hypertranscendence (1)
- Ignorance (1)
- Ignoranz (1)
- Image Registration (1)
- Infinite Optimierung (1)
- Innere-Punkte-Methode (1)
- Integral graph (1)
- Integralgleichung (1)
- Integrodifferentialgleichung (1)
- Interactive Help System (1)
- Interconnection (1)
- Invarianter Unterraum (1)
- Inverse Iteration (1)
- Inzidenzmatrix (1)
- Isomorphie (1)
- Isomorphieklasse (1)
- Isoparametrische Hyperfläche (1)
- Jacobi-Eigenwert-Verfahren (1)
- Jacobi-type eigenvalue methods (1)
- Jacobi-ähnliches Verfahren (1)
- Jacobsthal function (1)
- Jakob <Mathematiker (1)
- Julius Hurwitz (1)
- Kapitalverflechtung (1)
- Kapitalverflechtungen (1)
- Karush-Kuhn-Tucker-Bedingungen (1)
- Kettenbruch (1)
- Klassifikation (1)
- Kloosterman sum (1)
- Kollinearität (1)
- Kombinatorische Optimierung (1)
- Kombinatorische Zahlentheorie (1)
- Komprimierte Abtastung (1)
- Kondition <Mathematik> (1)
- Konforme Abbildungen (1)
- Konforme Metrik (1)
- Konjugierte-Gradienten-Methode (1)
- Konstruktionsmethoden (1)
- Kontinuitätsgleichung (1)
- Kontrollsystem (1)
- Konvergenz (1)
- Konvergenz bei quadratischem Eigenwertproblem (1)
- Konvexe Analysis (1)
- Korrekt gestelltes Problem (1)
- Korrelation (1)
- Kryptologie (1)
- Kurdyka--{\L}ojasiewicz property (1)
- Landau type theorem (1)
- Laser (1)
- Lasersimulation (1)
- Lennard-Jones-Potenzial (1)
- Lie groups (1)
- Lie-Gruppe (1)
- Liegruppen (1)
- Lindblad-Kossakowski Master Equation (1)
- Lineare Regression (1)
- Linearer Operator (1)
- Lineares System (1)
- Liouville and transport equations (1)
- Local Lipschitz continuity (1)
- Lyapunov Funktion (1)
- Lyapunov Stability (1)
- Lyapunov functions (1)
- M-Stationär (1)
- M-stationarity (1)
- MHD (1)
- MPCC (1)
- MPVC (1)
- Machzahl (1)
- Magnetic Resonance Imaging (1)
- Magnetoelasticity (1)
- Magnetohydrodynamics (1)
- Magnetohydrodynamik (1)
- Magnetoviscoelastic Fluids (1)
- Magnetoviskoelastische Flüsse (1)
- Mapping Properties (1)
- Master-Gleichung (1)
- Mathematical modeling (1)
- Mathematikunterricht (1)
- Mathematische Modellierung (1)
- Mathematisches Modell (1)
- Matrixpolynom (1)
- Matrizenpolynom (1)
- Matrizenzerlegung (1)
- Maße für Quantenverschränkung (1)
- Medical image reconstruction (1)
- Mehragentensystem (1)
- Mehrdimensionale Signalverarbeitung (1)
- Mehrgitter (1)
- Metrologie (1)
- Minimizing movements (1)
- Minimum Information Probability Distribution (1)
- Minimum Information Wahrscheinlichkeitsverteilung (1)
- Mobiler Roboter (1)
- Modellierung (1)
- Moment <Stochastik> (1)
- Monodromy (1)
- Monte Carlo Simulation (1)
- Moving mesh method (1)
- Multi-agent systems (1)
- Multivariate Generalized Pareto Distributions (1)
- Multivariate order statistics (1)
- Multivariate statistics (1)
- Multivariate verallgemeine Pareto-Verteilungen (1)
- Nash Equilibrium Problem (1)
- Navier-Stokes equations (1)
- Navier-Stokes-Gleichung (1)
- Near-Isomorphie (1)
- Nematic Liquid Crystals (1)
- Nematische Flüssigkristalle (1)
- Newton method (1)
- Newton's method (1)
- Newton-Raphson Method (1)
- Newton-Raphson Verfahren (1)
- Newtonverfahren (1)
- Nichtglatte Analysis (1)
- Nichtlineare Funktionalgleichung (1)
- Nichtlinearer Operator (1)
- Nichtlineares System (1)
- Nikaido-Isoda Funktion (1)
- Niveaustufen des Beweises (1)
- Non-smooth optimal control (1)
- Nonlinear systems (1)
- Nonparametric Inference (1)
- Nonsmooth optimization (1)
- Nullstelle (1)
- Numerical Asset Valuation (1)
- Numerical Methods (1)
- Numerik (1)
- Numerische Mathematik (1)
- Numerische Strömungssimulation (1)
- Operatortheorie (1)
- Optimal Control (1)
- Optimal control problem (1)
- Optimierung / Nebenbedingung (1)
- Optimierung auf Mannigfaltigkeiten (1)
- Optimierungsproblem (1)
- Optimization on Lie Groups (1)
- Order Statistics (1)
- Overstatement models (1)
- PDEs (1)
- Parabolic equations (1)
- Parametric inference (1)
- Parametric optimization (1)
- Parametrische Optimierung (1)
- Parametrisierung (1)
- Partielle Differentialgleichungen (1)
- Peaks over Threshold (1)
- Periodic homogenization (1)
- Plasma (1)
- Poisson Gleichung (1)
- Poisson equation (1)
- Polyatomare Verbindungen (1)
- Polynomial matrices (1)
- Pontrjagin-Maximumprinzip (1)
- Pontryagin Maximum Principle (1)
- Pontryagin Maximum Prinzip (1)
- Pontryagins's maximum principle (1)
- Post-Quantum-Kryptografie (1)
- Prediction Procedure (1)
- Primzahl (1)
- Probability theory (1)
- Prognose (1)
- Projektive Ebene (1)
- Proof (1)
- Proving Level (1)
- Proximal Method (1)
- Proximal-Punkt-Verfahren (1)
- Präkonditionierung (1)
- Pseudometrik (1)
- Quadratischer Zahlkörper (1)
- Quantenmechanik (1)
- Quantenmechanisches System (1)
- Quantum control (1)
- Quasi-Variational Inequality (1)
- Quasi-Variationsungleichung (1)
- Quasi-variational inequalities (1)
- Quasiconformal automorphism (1)
- Quasikonforme Abbildung (1)
- Randomness (1)
- Registrierung <Bildverarbeitung> (1)
- Regressionsanalyse (1)
- Regularisation Methods (1)
- Regularisierung (1)
- Regularisierungsverfahren (1)
- Regularized gap function (1)
- Regulator (1)
- Regulator <Mathematik> (1)
- Rekord (1)
- Relaxation method (1)
- Restklasse (1)
- Ridge-Regression (1)
- Riemann Hypothesis (1)
- Riemann zeta-function (1)
- Riemannian manifolds (1)
- Riemannian optimization (1)
- Riemannsche Geometrie (1)
- Riemannsche Mannigfaltigkeiten (1)
- Riemannsche Optimierung (1)
- Risikomanagement (1)
- Rothe method (1)
- Runge-type Theorems (1)
- Scheme for solving optimal control problems (1)
- Schnelle Fourier-Transformation (1)
- Schur ring (1)
- Schwache Kompaktheit (1)
- Schwache Lösungen (1)
- Selberg Class (1)
- Selberg Klasse (1)
- Selbergsche L-Reihe (1)
- Semismooth Newton Method (1)
- Sequential Quadratic Hamiltonian scheme (1)
- Sequential quadratic Hamiltonian scheme (1)
- Set-valued mapping (1)
- Shape Optimization (1)
- Skalierungsfunktion (1)
- Small-Gain Theorem (1)
- Softwareentwicklung (1)
- Sparsity (1)
- Sphäre (1)
- Spin systems (1)
- Spinsystem (1)
- Starke Kopplung (1)
- Statistik (1)
- Steuerbarkeit (1)
- Stochastic Algorithms (1)
- Stochastic Process (1)
- Stochastic homogenization (1)
- Stochastik (1)
- Stochastische Optimierung (1)
- Stochastisches System (1)
- Structrual Model (1)
- Strömung (1)
- Symmetrische Konfiguration (1)
- Symplektische Geometrie (1)
- System von partiellen Differentialgleichungen (1)
- Systemhalbgruppen (1)
- Systemic Risk (1)
- Systemsemigroups (1)
- TD Kohn-Sham equations (1)
- TDDFT (1)
- Tail-behavior (1)
- Topologieoptimierung (1)
- Torsion-free abelian groups (1)
- Torsionsfreie Abelsche Gruppe (1)
- Torsionsfreie abelsche Gruppe (1)
- Total Variation (1)
- Totale Variation (1)
- Toulmin Modell (1)
- Transitive Lie Groups (1)
- Transportkoeffizient (1)
- Uncertainty (1)
- Uniform distribution modulo one (1)
- Uniform topology (1)
- Universal Functions (1)
- Universality (1)
- Universalität (1)
- Unsicherheit (1)
- Untergruppe (1)
- Unternehmensbewertung (1)
- Unterraumsuche (1)
- Unterräume (1)
- Value ranges (1)
- Variationsrechnung (1)
- Variationsungleichung (1)
- Verfahren der konjugierten Gradienten (1)
- Vorhersagbarkeit (1)
- Vorhersagetheorie (1)
- Vorhersageverfahren (1)
- Vorkonditionierer (1)
- Wahrscheinlichkeitsrechnung (1)
- Wahrscheinlichkeitstheorie (1)
- Wahrscheinlichkeitsverteilung (1)
- Warteschlangennetz (1)
- Weak Solutions (1)
- Weibull distribution (1)
- Weibull-Verteilung (1)
- Wein (1)
- Well-Balanced (1)
- Well-posedness (1)
- Wettbewerbsdesign (1)
- ZRP (1)
- Zeitdiskrete Approximation (1)
- Zeitoptimale Regelung (1)
- Zero Range Prozess (1)
- Zero-divisor graph (1)
- Zero-inflation (1)
- Zeta-Functions (1)
- Zeta-function (1)
- Zufall (1)
- Zwei-Ebenen-Optimierung (1)
- a-point distribution (1)
- a-posteriori error estimates (1)
- abelian groups (1)
- adaptive refinement (1)
- affine scaling methods (1)
- algebraic aggregation (1)
- algebraic function field (1)
- algebraische Aggregation (1)
- almost completely decomosable group (1)
- almost completely decomposable group (1)
- almost completely decomposable groups (1)
- augmented Lagrangian method (1)
- bi-steerable robot (1)
- bias (1)
- black box (1)
- bound constraints (1)
- buildings (1)
- chordal Loewner equation (1)
- circular arc polygon domain (1)
- cohomology (1)
- collinearity (1)
- complementary problems (1)
- composite optimization (1)
- confidence interval (1)
- conformal mapping (1)
- conformal pseudo-metrics (1)
- conservation law (1)
- conservation laws (1)
- convergence (1)
- convergence for quadratic eigenvalue problems (1)
- convergent star product (1)
- convolutional code (1)
- coverings (1)
- cross-ownership (1)
- design (1)
- discrete-to-continuum (1)
- distribution modulo one (1)
- eigenmode (1)
- elliptic curves (1)
- enatnglement measure (1)
- entropy inequality (1)
- equivariant cohomology (1)
- ergodic transformation (1)
- error estimate (1)
- erstes Randwertproblem in PDE (1)
- exceedance counts (1)
- explicit discontinuous Galerkin (1)
- extremal coefficient (1)
- extremum seeking control (1)
- financial network (1)
- finanzielles Netzwerk (1)
- finite fields (1)
- finite projective plane (1)
- finite volume method (1)
- finite volume methods (1)
- firm valuation (1)
- first boundary value problem in PDE (1)
- fluid networks (1)
- fracture (1)
- freies Randwertproblem (1)
- function identification (1)
- functional D-norm (1)
- galois extensions (1)
- gamma-convergence (1)
- generalized quadrangles (1)
- geometric control (1)
- geometrische Kontrolltheorie (1)
- gewichtete Gleichverteilung modulo eins (1)
- global convergence (1)
- globale Konvergenz (1)
- gradient-like systems (1)
- gradientenähnliche Systeme (1)
- halbeinfache Lie Algebren (1)
- hierarchical matrix (1)
- higher order methods (1)
- homogene Raüme (1)
- homogeneous spaces (1)
- hydrodynamic limits (1)
- imaginary quadratic field (1)
- incidence matrix (1)
- infinite dimensional optimization (1)
- inverse Iteration (1)
- isogeny-based cryptography (1)
- isomorph (1)
- isomorphic (1)
- isomorpism (1)
- jump-diffusion processes (1)
- kinetic description of gases (1)
- konforme Pseudo-Metriken (1)
- large-scale (1)
- laser simulation (1)
- linear system (1)
- low Mach number (1)
- matrix decomposition (1)
- max-linear model (1)
- max-stable process (1)
- monodromy groups (1)
- multi-fluid mixture (1)
- multiply connected domain (1)
- multivariate Extreme Value Distribution (1)
- multivariate generalized Pareto distribution (1)
- near-isomorph (1)
- near-isomorphic (1)
- near-isomorphism (1)
- nichtglatt (1)
- nichtglatte Newton-artige Verfahren (1)
- nichtholonomes System (1)
- nichtlineare & gemischte Komplementaritätsprobleme (1)
- nichtlineare Optimierung (1)
- non-convex optimal control problems (1)
- nonholonomic system (1)
- nonlinear and mixed complementarity problems (1)
- nonlinear least squares reformulation (1)
- nonlinear optimization (1)
- nonlinear systems (1)
- numerical approximations (1)
- numerical methods (1)
- observer (1)
- optimal control problems (1)
- optimal solution mapping (1)
- optimization on manifolds (1)
- parametrization (1)
- partial differential equation (1)
- partial differetial equations (1)
- partial integro-differential equations (1)
- plasma modelling (1)
- polyatomic molecules (1)
- preconditioning (1)
- proximal Newton method (1)
- proximal gradient method (1)
- quadratic convergence (1)
- quadratic number field (1)
- quadratische Konvergenz (1)
- quasi-continuum (1)
- queueing networks (1)
- radial Loewner equation (1)
- random walk (1)
- reaction-diffusion (1)
- reduced residues (1)
- regression (1)
- regularization (1)
- regulating (1)
- regulator (1)
- regulierend (1)
- repelling phenomenon (1)
- representation of pseudo-metrics (1)
- ridge regression (1)
- semisimple Lie algebras (1)
- semismooth (1)
- semismooth Newton method (1)
- semismooth Newton-type methods (1)
- singularly perturbed problem (1)
- singulär gestörtes Problem (1)
- special sweeps (1)
- spezielle Sweep-Methoden (1)
- stability (1)
- state constraints (1)
- stochastic processes (1)
- stochastischer Prozess (1)
- structural model (1)
- structured normal form problem (1)
- strukturierte Normalformprobleme (1)
- subspace clustering (1)
- subspaces (1)
- sufficient optimality conditions (1)
- symmetric configuration (1)
- symplectic geometry (1)
- systemic risk (1)
- tail dependence (1)
- tensor rank (1)
- tight (1)
- time-optimal control (1)
- time-varying (1)
- total variation (1)
- transport coefficients (1)
- typically real functions (1)
- univalent functions (1)
- universality (1)
- verallgemeinerte Vierecke (1)
- vorticity preserving (1)
- weighted uniform distribution modulo one (1)
- well posedness (1)
- well-balancing (1)
- wine fermentation (1)
- zeitoptimale Steuerung (1)
- zero-finding (1)
- zweiachsgelenkter Roboter (1)
- Überschreitungen (1)
- Überschreitungsanzahl (1)
- Čebyšev-Polynome (1)
Institute
- Institut für Mathematik (109) (remove)
Sonstige beteiligte Institutionen
ResearcherID
- C-2593-2016 (1)
It is well known, that the least squares estimator performs poorly in the presence of multicollinearity. One way to overcome this problem is using biased estimators, e.g. ridge regression estimators. In this study an estimation procedure is proposed based on adding a small quantity omega on some or each regressor. The resulting biased estimator is described in dependence of omega and furthermore it is shown that its mean squared error is smaller than the one corresponding to the least squares estimator in the case of highly correlated regressors.
This thesis deals with a new so-called sequential quadratic Hamiltonian (SQH) iterative scheme to solve optimal control problems with differential models and cost functionals ranging from smooth to discontinuous and non-convex. This scheme is based on the Pontryagin maximum principle (PMP) that provides necessary optimality conditions for an optimal solution. In this framework, a Hamiltonian function is defined that attains its minimum pointwise at the optimal solution of the corresponding optimal control problem. In the SQH scheme, this Hamiltonian function is augmented by a quadratic penalty term consisting of the current control function and the control function from the previous iteration. The heart of the SQH scheme is to minimize this augmented Hamiltonian function pointwise in order to determine a control update. Since the PMP does not require any differ- entiability with respect to the control argument, the SQH scheme can be used to solve optimal control problems with both smooth and non-convex or even discontinuous cost functionals. The main achievement of the thesis is the formulation of a robust and efficient SQH scheme and a framework in which the convergence analysis of the SQH scheme can be carried out. In this framework, convergence of the scheme means that the calculated solution fulfills the PMP condition. The governing differential models of the considered optimal control problems are ordinary differential equations (ODEs) and partial differential equations (PDEs). In the PDE case, elliptic and parabolic equations as well as the Fokker-Planck (FP) equation are considered. For both the ODE and the PDE cases, assumptions are formulated for which it can be proved that a solution to an optimal control problem has to fulfill the PMP. The obtained results are essential for the discussion of the convergence analysis of the SQH scheme. This analysis has two parts. The first one is the well-posedness of the scheme which means that all steps of the scheme can be carried out and provide a result in finite time. The second part part is the PMP consistency of the solution. This means that the solution of the SQH scheme fulfills the PMP conditions. In the ODE case, the following results are obtained that state well-posedness of the SQH scheme and the PMP consistency of the corresponding solution. Lemma 7 states the existence of a pointwise minimum of the augmented Hamiltonian. Lemma 11 proves the existence of a weight of the quadratic penalty term such that the minimization of the corresponding augmented Hamiltonian results in a control updated that reduces the value of the cost functional. Lemma 12 states that the SQH scheme stops if an iterate is PMP optimal. Theorem 13 proves the cost functional reducing properties of the SQH control updates. The main result is given in Theorem 14, which states the pointwise convergence of the SQH scheme towards a PMP consistent solution. In this ODE framework, the SQH method is applied to two optimal control problems. The first one is an optimal quantum control problem where it is shown that the SQH method converges much faster to an optimal solution than a globalized Newton method. The second optimal control problem is an optimal tumor treatment problem with a system of coupled highly non-linear state equations that describe the tumor growth. It is shown that the framework in which the convergence of the SQH scheme is proved is applicable for this highly non-linear case. Next, the case of PDE control problems is considered. First a general framework is discussed in which a solution to the corresponding optimal control problem fulfills the PMP conditions. In this case, many theoretical estimates are presented in Theorem 59 and Theorem 64 to prove in particular the essential boundedness of the state and adjoint variables. The steps for the convergence analysis of the SQH scheme are analogous to that of the ODE case and result in Theorem 27 that states the PMP consistency of the solution obtained with the SQH scheme. This framework is applied to different elliptic and parabolic optimal control problems, including linear and bilinear control mechanisms, as well as non-linear state equations. Moreover, the SQH method is discussed for solving a state-constrained optimal control problem in an augmented formulation. In this case, it is shown in Theorem 30 that for increasing the weight of the augmentation term, which penalizes the violation of the state constraint, the measure of this state constraint violation by the corresponding solution converges to zero. Furthermore, an optimal control problem with a non-smooth L\(^1\)-tracking term and a non-smooth state equation is investigated. For this purpose, an adjoint equation is defined and the SQH method is used to solve the corresponding optimal control problem. The final part of this thesis is devoted to a class of FP models related to specific stochastic processes. The discussion starts with a focus on random walks where also jumps are included. This framework allows a derivation of a discrete FP model corresponding to a continuous FP model with jumps and boundary conditions ranging from absorbing to totally reflecting. This discussion allows the consideration of the drift-control resulting from an anisotropic probability of the steps of the random walk. Thereafter, in the PMP framework, two drift-diffusion processes and the corresponding FP models with two different control strategies for an optimal control problem with an expectation functional are considered. In the first strategy, the controls depend on time and in the second one, the controls depend on space and time. In both cases a solution to the corresponding optimal control problem is characterized with the PMP conditions, stated in Theorem 48 and Theorem 49. The well-posedness of the SQH scheme is shown in both cases and further conditions are discussed that ensure the convergence of the SQH scheme to a PMP consistent solution. The case of a space and time dependent control strategy results in a special structure of the corresponding PMP conditions that is exploited in another solution method, the so-called direct Hamiltonian (DH) method.
In this work, multi-particle quantum optimal control problems are studied in the framework of time-dependent density functional theory (TDDFT).
Quantum control problems are of great importance in both fundamental research and application of atomic and molecular systems. Typical applications are laser induced chemical reactions, nuclear magnetic resonance experiments, and quantum computing.
Theoretically, the problem of how to describe a non-relativistic system of multiple particles is solved by the Schrödinger equation (SE). However, due to the exponential increase in numerical complexity with the number of particles, it is impossible to directly solve the Schrödinger equation for large systems of interest. An efficient and successful approach to overcome this difficulty is the framework of TDDFT and the use of the time-dependent Kohn-Sham (TDKS) equations therein.
This is done by replacing the multi-particle SE with a set of nonlinear single-particle Schrödinger equations that are coupled through an additional potential.
Despite the fact that TDDFT is widely used for physical and quantum chemical calculation and software packages for its use are readily available, its mathematical foundation is still under active development and even fundamental issues remain unproven today.
The main purpose of this thesis is to provide a consistent and rigorous setting for the TDKS equations and of the related optimal control problems.
In the first part of the thesis, the framework of density functional theory (DFT) and TDDFT are introduced. This includes a detailed presentation of the different functional sets forming DFT. Furthermore, the known equivalence of the TDKS system to the original SE problem is further discussed.
To implement the TDDFT framework for multi-particle computations, the TDKS equations provide one of the most successful approaches nowadays. However, only few mathematical results concerning these equations are available and these results do not cover all issues that arise in the formulation of optimal control problems governed by the TDKS model.
It is the purpose of the second part of this thesis to address these issues such as higher regularity of TDKS solutions and the case of weaker requirements on external (control) potentials that are instrumental for the formulation of well-posed TDKS control problems. For this purpose, in this work, existence and uniqueness of TDKS solutions are investigated in the Galerkin framework and using energy estimates for the nonlinear TDKS equations.
In the third part of this thesis, optimal control problems governed by the TDKS model are formulated and investigated. For this purpose, relevant cost functionals that model the purpose of the control are discussed.
Henceforth, TDKS control problems result from the requirement of optimising the given cost functionals subject to the differential constraint given by the TDKS equations. The analysis of these problems is novel and represents one of the main contributions of the present thesis.
In particular, existence of minimizers is proved and their characterization by TDKS optimality systems is discussed in detail.
To this end, Fréchet differentiability of the TDKS model and of the cost functionals is addressed considering \(H^1\) cost of the control.
This part is concluded by deriving the reduced gradient in the \(L^2\) and \(H^1\) inner product.
While the \(L^2\) optimization is widespread in the literature, the choice of the \(H^1\) gradient is motivated in this work by theoretical consideration and by resulting numerical advantages.
The last part of the thesis is devoted to the numerical approximation of the TDKS optimality systems and to their solution by gradient-based optimization techniques.
For the former purpose, Strang time-splitting pseudo-spectral schemes are discussed including a review of some recent theoretical estimates for these schemes and a numerical validation of these estimates.
For the latter purpose, nonlinear (projected) conjugate gradient methods are implemented and are used to validate the theoretical analysis of this thesis with results of numerical experiments with different cost functional settings.
ADMM-Type Methods for Optimization and Generalized Nash Equilibrium Problems in Hilbert Spaces
(2020)
This thesis is concerned with a certain class of algorithms for the solution of constrained optimization problems and generalized Nash equilibrium problems in Hilbert spaces. This class of algorithms is inspired by the alternating direction method of multipliers (ADMM) and eliminates the constraints using an augmented Lagrangian approach. The alternating direction method consists of splitting the augmented Lagrangian subproblem into smaller and more easily manageable parts.
Before the algorithms are discussed, a substantial amount of background material, including the theory of Banach and Hilbert spaces, fixed-point iterations as well as convex and monotone set-valued analysis, is presented. Thereafter, certain optimization problems and generalized Nash equilibrium problems are reformulated and analyzed using variational inequalities and set-valued mappings. The analysis of the algorithms developed in the course of this thesis is rooted in these reformulations as variational inequalities and set-valued mappings.
The first algorithms discussed and analyzed are one weakly and one strongly convergent ADMM-type algorithm for convex, linearly constrained optimization. By equipping the associated Hilbert space with the correct weighted scalar product, the analysis of these two methods is accomplished using the proximal point method and the Halpern method.
The rest of the thesis is concerned with the development and analysis of ADMM-type algorithms for generalized Nash equilibrium problems that jointly share a linear equality constraint. The first class of these algorithms is completely parallelizable and uses a forward-backward idea for the analysis, whereas the second class of algorithms can be interpreted as a direct extension of the classical ADMM-method to generalized Nash equilibrium problems.
At the end of this thesis, the numerical behavior of the discussed algorithms is demonstrated on a collection of examples.
Several aspects of the stability analysis of large-scale discrete-time systems are considered. An important feature is that the right-hand side does not have have to be continuous.
In particular, constructive approaches to compute Lyapunov functions are derived and applied to several system classes.
For large-scale systems, which are considered as an interconnection of smaller subsystems, we derive a new class of small-gain results, which do not require the subsystems to be robust in some sense. Moreover, we do not only study sufficiency of the conditions, but rather state an assumption under which these conditions are also necessary.
Moreover, gain construction methods are derived for several types of aggregation, quantifying how large a prescribed set of interconnection gains can be in order that a small-gain condition holds.
In this thesis affine-scaling-methods for two different types of mathematical problems are considered. The first type of problems are nonlinear optimization problems subject to bound constraints. A class of new affine-scaling Newton-type methods is introduced. The methods are shown to be locally quadratically convergent without assuming strict complementarity of the solution. The new methods differ from previous ones mainly in the choice of the scaling matrix. The second type of problems are semismooth system of equations with bound constraints. A new affine-scaling trust-region method for these problems is developed. The method is shown to have strong global and local convergence properties under suitable assumptions. Numerical results are presented for a number of problems arising from different areas.
In the present thesis we investigate algebraic and arithmetic properties of graph spectra. In particular, we study the algebraic degree of a graph, that is the dimension of the splitting field of the characteristic polynomial of the associated adjacency matrix over the rationals, and examine the question whether there is a relation between the algebraic degree of a graph and its structural properties. This generalizes the yet open question ``Which graphs have integral spectra?'' stated by Harary and Schwenk in 1974.
We provide an overview of graph products since they are useful to study graph spectra and, in particular, to construct families of integral graphs. Moreover, we present a relation between the diameter, the maximum vertex degree and the algebraic degree of a graph, and construct a potential family of graphs of maximum algebraic degree.
Furthermore, we determine precisely the algebraic degree of circulant graphs and find new criteria for isospectrality of circulant graphs. Moreover, we solve the inverse Galois problem for circulant graphs showing that every finite abelian extension of the rationals is the splitting field of some circulant graph. Those results generalize a theorem of So who characterized all integral circulant graphs. For our proofs we exploit the theory of Schur rings which was already used in order to solve the isomorphism problem for circulant graphs.
Besides that, we study spectra of zero-divisor graphs over finite commutative rings.
Given a ring \(R\), the zero-divisor graph over \(R\) is defined as the graph with vertex set being the set of non-zero zero-divisors of \(R\) where two vertices \(x,y\) are adjacent if and only if \(xy=0\). We investigate relations between the eigenvalues of a zero-divisor graph, its structural properties and the algebraic properties of the respective ring.
A torsion free abelian group of finite rank is called almost completely decomposable if it has a completely decomposable subgroup of finite index. A p-local, p-reduced almost completely decomposable group of type (1,2) is briefly called a (1,2)-group. Almost completely decomposable groups can be represented by matrices over the ring Z/hZ, where h is the exponent of the regulator quotient. This particular choice of representation allows for a better investigation of the decomposability of the group. Arnold and Dugas showed in several of their works that (1,2)-groups with regulator quotient of exponent at least p^7 allow infinitely many isomorphism types of indecomposable groups. It is not known if the exponent 7 is minimal. In this dissertation, this problem is addressed.
Analysis of discretization schemes for Fokker-Planck equations and related optimality systems
(2015)
The Fokker-Planck (FP) equation is a fundamental model in thermodynamic kinetic theories and
statistical mechanics.
In general, the FP equation appears in a number of different fields in natural sciences, for instance in solid-state physics, quantum optics, chemical physics, theoretical biology, and circuit theory. These equations also provide a powerful mean to define
robust control strategies for random models. The FP equations are partial differential equations (PDE) describing the time evolution of the probability density function (PDF) of stochastic processes.
These equations are of different types depending on the underlying stochastic process.
In particular, they are parabolic PDEs for the PDF of Ito processes, and hyperbolic PDEs for piecewise deterministic processes (PDP).
A fundamental axiom of probability calculus requires that the integral of the PDF over all the allowable state space must be equal to one, for all time. Therefore, for the purpose of accurate numerical simulation, a discretized FP equation must guarantee conservativeness of the total probability. Furthermore, since the
solution of the FP equation represents a probability density, any numerical scheme that approximates the FP equation is required to guarantee the positivity of the solution. In addition, an approximation scheme must be accurate and stable.
For these purposes, for parabolic FP equations on bounded domains, we investigate the Chang-Cooper (CC) scheme for space discretization and first- and
second-order backward time differencing. We prove that the resulting
space-time discretization schemes are accurate, conditionally stable, conservative, and preserve positivity.
Further, we discuss a finite difference discretization for the FP system corresponding to a PDP process in a bounded domain.
Next, we discuss FP equations in unbounded domains.
In this case, finite-difference or finite-element methods cannot be applied. By employing a suitable set of basis functions, spectral methods allow to treat unbounded domains. Since FP solutions decay exponentially at infinity, we consider Hermite functions as basis functions, which are Hermite polynomials multiplied by a Gaussian.
To this end, the Hermite spectral discretization is applied
to two different FP equations; the parabolic PDE corresponding to Ito processes, and the system of hyperbolic PDEs corresponding to a PDP process. The resulting discretized schemes are analyzed. Stability and spectral accuracy of the Hermite spectral discretization of the FP problems is proved. Furthermore, we investigate the conservativity of the solutions of FP equations discretized with the Hermite spectral scheme.
In the last part of this thesis, we discuss optimal control problems governed by FP equations on the characterization of their solution by optimality systems. We then investigate the Hermite spectral discretization of FP optimality systems in unbounded domains.
Within the framework of Hermite discretization, we obtain sparse-band systems of ordinary differential equations. We analyze the accuracy of the discretization schemes by showing spectral convergence in approximating the state, the adjoint, and the control variables that appear in the FP optimality systems.
To validate our theoretical estimates, we present results of numerical experiments.
The present thesis considers the development and analysis of arbitrary Lagrangian-Eulerian
discontinuous Galerkin (ALE-DG) methods with time-dependent approximation spaces for
conservation laws and the Hamilton-Jacobi equations.
Fundamentals about conservation laws, Hamilton-Jacobi equations and discontinuous Galerkin
methods are presented. In particular, issues in the development of discontinuous Galerkin (DG)
methods for the Hamilton-Jacobi equations are discussed.
The development of the ALE-DG methods based on the assumption that the distribution of
the grid points is explicitly given for an upcoming time level. This assumption allows to construct a time-dependent local affine linear mapping to a reference cell and a time-dependent
finite element test function space. In addition, a version of Reynolds’ transport theorem can be
proven.
For the fully-discrete ALE-DG method for nonlinear scalar conservation laws the geometric
conservation law and a local maximum principle are proven. Furthermore, conditions for slope
limiters are stated. These conditions ensure the total variation stability of the method. In addition, entropy stability is discussed. For the corresponding semi-discrete ALE-DG method,
error estimates are proven. If a piecewise $\mathcal{P}^{k}$ polynomial approximation space is used on the reference cell, the sub-optimal $\left(k+\frac{1}{2}\right)$ convergence for monotone fuxes and the optimal $(k+1)$ convergence for an upwind flux are proven in the $\mathrm{L}^{2}$-norm. The capability of the method is shown by numerical examples for nonlinear conservation laws.
Likewise, for the semi-discrete ALE-DG method for nonlinear Hamilton-Jacobi equations, error
estimates are proven. In the one dimensional case the optimal $\left(k+1\right)$ convergence and in the two dimensional case the sub-optimal $\left(k+\frac{1}{2}\right)$ convergence are proven in the $\mathrm{L}^{2}$-norm, if a piecewise $\mathcal{P}^{k}$ polynomial approximation space is used on the reference cell. For the fullydiscrete method, the geometric conservation is proven and for the piecewise constant forward Euler step the convergence of the method to the unique physical relevant solution is discussed.