Searcharxiv⌕ Search

arXiv subjects

Michael Hintermüller

Publications and source records attributed to Michael Hintermüller.

39 records · Page 3Linked to original sources

Limiting aspects of non-convex ${TV}^ϕ$ models

Recently, non-convex regularisation models have been introduced in order to provide a better prior for gradient distributions in real images. They are based on using concave energies $ϕ$ in the total variation type functional ${TV}^ϕ(u) := \int ϕ(|\nabla u(x)|) d x$. In this paper, it is demonstrated that for typical choices of $ϕ$, functionals of this type pose several difficulties when extended to the entire space of functions of bounded variation, ${BV}(Ω)$. In particular, if $ϕ(t)=t^q$ for $q \in (0, 1)$ and ${TV}^ϕ$ is defined directly for piecewise constant functions and extended via weak* lower semicontinuous envelopes to ${BV}(Ω)$, then still ${TV}^ϕ(u)=\infty$ for $u$ not piecewise constant. If, on the other hand, ${TV}^ϕ$ is defined analogously via continuously differentiable functions, then ${TV}^ϕ\equiv 0$, (!). We study a way to remedy the models through additional multiscale regularisation and area strict convergence, provided that the energy $ϕ(t)=t^q$ is linearised for high values. The fact, that this kind of energies actually better matches reality and improves reconstructions, is demonstrated by statistics and numerical experiments.

math.FA↗

Exact Relaxation for Classes of Minimization Problems with Binary Constraints

Relying on the co-area formula, an exact relaxation framework for minimizing objectives involving the total variation of a binary valued function (of bounded variation) is presented. The underlying problem class covers many important applications ranging from binary image restoration, segmentation, minimal compliance topology optimization to the optimal design of composite membranes and many more. The relaxation approach turns the binary constraint into a box constraint. It is shown that thresholding a solution of the relaxed problem almost surely yields a solution of the original binary-valued problem. Furthermore, stability of solutions under data perturbations is studied, and, for applications such as structure optimization, the inclusion of volume constraints is considered. For the efficient numerical solution of the relaxed problem, a locally superlinearly convergent algorithm is proposed which is based on an exact penalization technique, Fenchel duality, and a semismooth Newton approach. The paper ends by a report on numerical results for several applications in particular in mathematical image processing.

math.OC↗

Optimal bilinear control of Gross-Pitaevskii equations

A mathematical framework for optimal bilinear control of nonlinear Schrödinger equations of Gross-Pitaevskii type arising in the description of Bose-Einstein condensates is presented. The obtained results generalize earlier efforts found in the literature in several aspects. In particular, the cost induced by the physical work load over the control process is taken into account rather then often used $L^2$- or $H^1$-norms for the cost of the control action. Well-posedness of the problem and existence of an optimal control is proven. In addition, the first order optimality system is rigorously derived. Also a numerical solution method is proposed, which is based on a Newton type iteration, and used to solve several coherent quantum control problems.

math.OC↗