Search Results

Now showing 1 - 10 of 44
  • Item
    Existence, iteration procedures and directional differentiability for parabolic QVIs
    (Berlin ; Heidelberg : Springer, 2020) Alphonse, Amal; Hintermüller, Michael; Rautenberg, Carlos N.
    We study parabolic quasi-variational inequalities (QVIs) of obstacle type. Under appropriate assumptions on the obstacle mapping, we prove the existence of solutions of such QVIs by two methods: one by time discretisation through elliptic QVIs and the second by iteration through parabolic variational inequalities. Using these results, we show the directional differentiability (in a certain sense) of the solution map which takes the source term of a parabolic QVI into the set of solutions, and we relate this result to the contingent derivative of the aforementioned map. We finish with an example where the obstacle mapping is given by the inverse of a parabolic differential operator.
  • Item
    Uncertainty Quantification in Image Segmentation Using the Ambrosio–Tortorelli Approximation of the Mumford–Shah Energy
    (Dordrecht [u.a.] : Springer Science + Business Media B.V, 2021) Hintermüller, Michael; Stengl, Steven-Marian; Surowiec, Thomas M.
    The quantification of uncertainties in image segmentation based on the Mumford–Shah model is studied. The aim is to address the error propagation of noise and other error types in the original image to the restoration result and especially the reconstructed edges (sharp image contrasts). Analytically, we rely on the Ambrosio–Tortorelli approximation and discuss the existence of measurable selections of its solutions as well as sampling-based methods and the limitations of other popular methods. Numerical examples illustrate the theoretical findings.
  • Item
    Variable Step Mollifiers and Applications
    (Berlin ; Heidelberg : Springer, 2020) Hintermüller, Michael; Papafitsoros, Kostas; Rautenberg, Carlos N.
    We consider a mollifying operator with variable step that, in contrast to the standard mollification, is able to preserve the boundary values of functions. We prove boundedness of the operator in all basic Lebesgue, Sobolev and BV spaces as well as corresponding approximation results. The results are then applied to extend recently developed theory concerning the density of convex intersections. © 2020, The Author(s).
  • Item
    Optimization with learning-informed differential equation constraints and its applications
    (Les Ulis : EDP Sciences, 2022) Dong, Guozhi; Hintermüller, Michael; Papafitsoros, Kostas
    Inspired by applications in optimal control of semilinear elliptic partial differential equations and physics-integrated imaging, differential equation constrained optimization problems with constituents that are only accessible through data-driven techniques are studied. A particular focus is on the analysis and on numerical methods for problems with machine-learned components. For a rather general context, an error analysis is provided, and particular properties resulting from artificial neural network based approximations are addressed. Moreover, for each of the two inspiring applications analytical details are presented and numerical results are provided.
  • Item
    A semismooth Newton method with analytical path-following for the H1-projection onto the Gibbs simplex
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2016) Adam, Lukáš; Hintermüller, Michael; Surowiec, Thomas M.
    An efficient, function-space-based second-order method for the H1-projection onto the Gibbs-simplex is presented. The method makes use of the theory of semismooth Newton methods in function spaces as well as Moreau-Yosida regularization and techniques from parametric optimization. A path-following technique is considered for the regularization parameter updates. A rigorous first and second-order sensitivity analysis of the value function for the regularized problem is provided to justify the update scheme. The viability of the algorithm is then demonstrated for two applications found in the literature: binary image inpainting and labeled data classification. In both cases, the algorithm exhibits meshindependent behavior.
  • Item
    Generalized Nash equilibrium problems with partial differential operators: Theory, algorithms, and risk aversion
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2019) Gahururu, Deborah; Hintermüller, Michael; Stengl, Steven-Marian; Surowiec, Thomas M.
    PDE-constrained (generalized) Nash equilibrium problems (GNEPs) are considered in a deterministic setting as well as under uncertainty. This includes a study of deterministic GNEPs with nonlinear and/or multivalued operator equations as forward problems and PDE-constrained GNEPs with uncertain data. The deterministic nonlinear problems are analyzed using the theory of generalized convexity for set-valued operators, and a variational approximation approach is proposed. The stochastic setting includes a detailed overview of the recently developed theory and algorithms for risk-averse PDE-constrained optimization problems. These new results open the way to a rigorous study of stochastic PDE-constrained GNEPs.
  • Item
    Adaptive regularization for image reconstruction from subsampled data
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2017) Hintermüller, Michael; Langer, Andreas; Rautenberg, Carlos N.; Wu, Tao
    Choices of regularization parameters are central to variational methods for image restoration. In this paper, a spatially adaptive (or distributed) regularization scheme is developed based on localized residuals, which properly balances the regularization weight between regions containing image details and homogeneous regions. Surrogate iterative methods are employed to handle given subsampled data in transformed domains, such as Fourier or wavelet data. In this respect, this work extends the spatially variant regularization technique previously established in [15], which depends on the fact that the given data are degraded images only. Numerical experiments for the reconstruction from partial Fourier data and for wavelet inpainting prove the efficiency of the newly proposed approach.
  • Item
    Optimal selection of the regularization function in a generalized total variation model. Part II: Algorithm, its analysis and numerical tests
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2016) Hintermüller, Michael; Rautenberg, Carlos N.; Wu, Tao; Langer, Andreas
    Based on the generalized total variation model and its analysis pursued in part I (WIAS Preprint no. 2235), in this paper a continuous, i.e., infinite dimensional, projected gradient algorithm and its convergence analysis are presented. The method computes a stationary point of a regularized bilevel optimization problem for simultaneously recovering the image as well as determining a spatially distributed regularization weight. Further, its numerical realization is discussed and results obtained for image denoising and deblurring as well as Fourier and wavelet inpainting are reported on.
  • Item
    Dualization and automatic distributed parameter selection of total generalized variation via bilevel optimization
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Hintermüller, Michael; Papafitsoros, Kostas; Rautenberg, Carlos N.; Sun, Hongpeng
    Total Generalized Variation (TGV) regularization in image reconstruction relies on an infimal convolution type combination of generalized first- and second-order derivatives. This helps to avoid the staircasing effect of Total Variation (TV) regularization, while still preserving sharp contrasts in images. The associated regularization effect crucially hinges on two parameters whose proper adjustment represents a challenging task. In this work, a bilevel optimization framework with a suitable statistics-based upper level objective is proposed in order to automatically select these parameters. The framework allows for spatially varying parameters, thus enabling better recovery in high-detail image areas. A rigorous dualization framework is established, and for the numerical solution, two Newton type methods for the solution of the lower level problem, i.e. the image reconstruction problem, and two bilevel TGV algorithms are introduced, respectively. Denoising tests confirm that automatically selected distributed regularization parameters lead in general to improved reconstructions when compared to results for scalar parameters.
  • Item
    Constrained exact boundary controllability of a semilinear model for pipeline gas flow
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2021) Gugat, Martin; Habermann, Jens; Hintermüller, Michael; Huber, Olivier
    While the quasilinear isothermal Euler equations are an excellent model for gas pipeline flow, the operation of the pipeline flow with high pressure and small Mach numbers allows us to obtain approximate solutions by a simpler semilinear model. We provide a derivation of the semilinear model that shows that the semilinear model is valid for sufficiently low Mach numbers and sufficiently high pressures. We prove an existence result for continuous solutions of the semilinear model that takes into account lower and upper bounds for the pressure and an upper bound for the magnitude of the Mach number of the gas flow. These state constraints are important both in the operation of gas pipelines and to guarantee that the solution remains in the set where the model is physically valid. We show the constrained exact boundary controllability of the system with the same pressure and Mach number constraints.