@article{AndresArconesWeiserKoutsourelakisetal.2023, author = {Andr{\´e}s Arcones, Daniel and Weiser, Martin and Koutsourelakis, Faidon-Stelios and Unger, J{\"o}rg F.}, title = {A Bayesian Framework for Simulation-based Digital Twins of Bridges}, volume = {6}, journal = {EUROSTRUCT 2023:European Association on Quality Control of Bridges and Structures: Digital Transformation in Sustainability}, number = {5}, doi = {10.1002/cepa.2177}, pages = {734 -- 740}, year = {2023}, abstract = {Simulation-based digital twins have emerged as a powerful tool for evaluating the mechanical response of bridges. As virtual representations of physical systems, digital twins can provide a wealth of information that complements traditional inspection and monitoring data. By incorporating virtual sensors and predictive maintenance strategies, they have the potential to improve our understanding of the behavior and performance of bridges over time. However, as bridges age and undergo regular loading and extreme events, their structural characteristics change, often differing from the predictions of their initial design. Digital twins must be continuously adapted to reflect these changes. In this article, we present a Bayesian framework for updating simulation-based digital twins in the context of bridges. Our approach integrates information from measurements to account for inaccuracies in the simulation model and quantify uncertainties. Through its implementation and assessment, this work demonstrates the potential for digital twins to provide a reliable and up-to-date representation of bridge behavior, helping to inform decision-making for maintenance and management.}, language = {en} } @article{GoebelHuynhCheginietal.2025, author = {G{\"o}bel, Fritz and Huynh, Ngoc Mai Monica and Chegini, Fatemeh and Pavarino, Luca and Weiser, Martin and Scacchi, Simone and Anzt, Hartwig}, title = {A BDDC Preconditioner for the Cardiac EMI Model in three Dimensions}, journal = {SIAM J. Sci. Comput.}, arxiv = {http://arxiv.org/abs/2502.07722}, year = {2025}, abstract = {We analyze a Balancing Domain Decomposition by Constraints (BDDC) preconditioner for the solution of three dimensional composite Discontinuous Galerkin discretizations of reaction-diffusion systems of ordinary and partial differential equations arising in cardiac cell-by-cell models like the Extracellular space, Membrane and Intracellular space (EMI) Model. These microscopic models are essential for the understanding of events in aging and structurally diseased hearts which macroscopic models relying on homogenized descriptions of the cardiac tissue, like Monodomain and Bidomain models, fail to adequately represent. The modeling of each individual cardiac cell results in discontinuous global solutions across cell boundaries, requiring the careful construction of dual and primal spaces for the BDDC preconditioner. We provide a scalable condition number bound for the precondition operator and validate the theoretical results with extensive numerical experiments.}, language = {en} } @article{WeiserGaenzlerSchiela2008, author = {Weiser, Martin and G{\"a}nzler, Tobias and Schiela, Anton}, title = {A control reduced primal interior point method for a class of control constrained optimal control problems}, volume = {41}, journal = {Comput. Optim. Appl.}, number = {1}, pages = {127 -- 145}, year = {2008}, language = {en} } @misc{WeiserGaenzlerSchiela2004, author = {Weiser, Martin and G{\"a}nzler, Tobias and Schiela, Anton}, title = {A Control Reduced Primal Interior Point Method for PDE Constrained Optimization}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8138}, number = {04-38}, year = {2004}, abstract = {A primal interior point method for control constrained optimal control problems with PDE constraints is considered. Pointwise elimination of the control leads to a homotopy in the remaining state and dual variables, which is addressed by a short step pathfollowing method. The algorithm is applied to the continuous, infinite dimensional problem, where discretization is performed only in the innermost loop when solving linear equations. The a priori elimination of the least regular control permits to obtain the required accuracy with comparable coarse meshes. Convergence of the method and discretization errors are studied, and the method is illustrated at two numerical examples.}, language = {en} } @article{BorndoerferDaneckerWeiser2021, author = {Bornd{\"o}rfer, Ralf and Danecker, Fabian and Weiser, Martin}, title = {A Discrete-Continuous Algorithm for Free Flight Planning}, volume = {14}, journal = {Algorithms}, number = {1}, publisher = {MDPI}, issn = {1438-0064}, doi = {10.3390/a14010004}, pages = {4}, year = {2021}, abstract = {We propose a hybrid discrete-continuous algorithm for flight planning in free flight airspaces. In a first step, our DisCOptER method discrete-continuous optimization for enhanced resolution) computes a globally optimal approximate flight path on a discretization of the problem using the A* method. This route initializes a Newton method that converges rapidly to the smooth optimum in a second step. The correctness, accuracy, and complexity of the method are goverened by the choice of the crossover point that determines the coarseness of the discretization. We analyze the optimal choice of the crossover point and demonstrate the asymtotic superority of DisCOptER over a purely discrete approach.}, language = {en} } @article{DeuflhardWeiserSeebass2000, author = {Deuflhard, Peter and Weiser, Martin and Seebass, Martin}, title = {A new nonlinear elliptic multilevel FEM in clinical cancer therapy planning}, volume = {3}, journal = {Comput. Vis. Sci.}, pages = {115 -- 120}, year = {2000}, language = {en} } @article{SchielaStoeckleinWeiser2021, author = {Schiela, Anton and St{\"o}cklein, Matthias and Weiser, Martin}, title = {A primal dual projection algorithm for efficient constraint preconditioning}, volume = {43}, journal = {SIAM Journal on Scientific Computing}, number = {6}, doi = {10.1137/20M1380739}, pages = {A4095 -- A4120}, year = {2021}, abstract = {We consider a linear iterative solver for large scale linearly constrained quadratic minimization problems that arise, for example, in optimization with PDEs. By a primal-dual projection (PDP) iteration, which can be interpreted and analysed as a gradient method on a quotient space, the given problem can be solved by computing sulutions for a sequence of constrained surrogate problems, projections onto the feasible subspaces, and Lagrange multiplier updates. As a major application we consider a class of optimization problems with PDEs, where PDP can be applied together with a projected cg method using a block triangular constraint preconditioner. Numerical experiments show reliable and competitive performance for an optimal control problem in elasticity.}, language = {en} } @article{WeihrauchWustWeiseretal.2007, author = {Weihrauch, Mirko and Wust, Peter and Weiser, Martin and Nadobny, Johanna and Eisenhardt, Steffen and Budach, Volker and Gellermann, Johanna}, title = {Adaptation of antenna profiles for control of MR guided hyperthermia (HT) in a hybrid MR-HT system}, volume = {34}, journal = {Medical Physics}, number = {12}, pages = {4717 -- 4725}, year = {2007}, language = {en} } @article{MoldenhauerWeiserZachow2017, author = {Moldenhauer, Marian and Weiser, Martin and Zachow, Stefan}, title = {Adaptive Algorithms for Optimal Hip Implant Positioning}, volume = {17}, journal = {PAMM}, number = {1}, doi = {10.1002/pamm.201710071}, pages = {203 -- 204}, year = {2017}, abstract = {In an aging society where the number of joint replacements rises, it is important to also increase the longevity of implants. In particular hip implants have a lifetime of at most 15 years. This derives primarily from pain due to implant migration, wear, inflammation, and dislocation, which is affected by the positioning of the implant during the surgery. Current joint replacement practice uses 2D software tools and relies on the experience of surgeons. Especially the 2D tools fail to take the patients' natural range of motion as well as stress distribution in the 3D joint induced by different daily motions into account. Optimizing the hip joint implant position for all possible parametrized motions under the constraint of a contact problem is prohibitively expensive as there are too many motions and every position change demands a recalculation of the contact problem. For the reduction of the computational effort, we use adaptive refinement on the parameter domain coupled with the interpolation method of Kriging. A coarse initial grid is to be locally refined using goal-oriented error estimation, reducing locally high variances. This approach will be combined with multi-grid optimization such that numerical errors are reduced.}, language = {en} } @inproceedings{VillaniUngerWeiser2024, author = {Villani, Paolo and Unger, J{\"o}rg F. and Weiser, Martin}, title = {Adaptive Gaussian Process Regression for Bayesian inverse problems}, booktitle = {Proceedings of the Conference Algoritmy 2024}, pages = {214 -- 224}, year = {2024}, abstract = {We introduce a novel adaptive Gaussian Process Regression (GPR) methodology for efficient construction of surrogate models for Bayesian inverse problems with expensive forward model evaluations. An adaptive design strategy focuses on optimizing both the positioning and simulation accuracy of training data in order to reduce the computational cost of simulating training data without compromising the fidelity of the posterior distributions of parameters. The method interleaves a goal-oriented active learning algorithm selecting evaluation points and tolerances based on the expected impact on the Kullback-Leibler divergence of surrogated and true posterior with a Markov Chain Monte Carlo sampling of the posterior. The performance benefit of the adaptive approach is demonstrated for two simple test problems.}, language = {en} } @article{SemlerWeiser2023, author = {Semler, Phillip and Weiser, Martin}, title = {Adaptive Gaussian Process Regression for Efficient Building of Surrogate Models in Inverse Problems}, volume = {39}, journal = {Inverse Problems}, number = {12}, arxiv = {http://arxiv.org/abs/2303.05824}, doi = {10.1088/1361-6420/ad0028}, pages = {125003}, year = {2023}, abstract = {In a task where many similar inverse problems must be solved, evaluating costly simulations is impractical. Therefore, replacing the model y with a surrogate model y(s) that can be evaluated quickly leads to a significant speedup. The approximation quality of the surrogate model depends strongly on the number, position, and accuracy of the sample points. With an additional finite computational budget, this leads to a problem of (computer) experimental design. In contrast to the selection of sample points, the trade-off between accuracy and effort has hardly been studied systematically. We therefore propose an adaptive algorithm to find an optimal design in terms of position and accuracy. Pursuing a sequential design by incrementally appending the computational budget leads to a convex and constrained optimization problem. As a surrogate, we construct a Gaussian process regression model. We measure the global approximation error in terms of its impact on the accuracy of the identified parameter and aim for a uniform absolute tolerance, assuming that y(s) is computed by finite element calculations. A priori error estimates and a coarse estimate of computational effort relate the expected improvement of the surrogate model error to computational effort, resulting in the most efficient combination of sample point and evaluation tolerance. We also allow for improving the accuracy of already existing sample points by continuing previously truncated finite element solution procedures.}, language = {en} } @misc{VillaniWeiser2024, author = {Villani, Paolo and Weiser, Martin}, title = {Adaptive Gaussian process regression for inverse problems. ALGORITMY 2024}, year = {2024}, abstract = {This submission contains the code used for the proceedings paper for ALGORITMY 2024, concerning surrogate model-based inverse problems. Version 2 modified plot appearances and fixed some minor typos.}, language = {en} } @inproceedings{SemlerWeiser2025, author = {Semler, Phillip and Weiser, Martin}, title = {Adaptive gradient-enhanced Gaussian process surrogates for inverse problems}, booktitle = {Mathematical Optimization for Machine Learning: Proceedings of the MATH+ Thematic Einstein Semester 2023}, editor = {Fackeldey, Konstantin and Kannan, Aswin and Pokutta, Sebastian and Sharma, Kartikey and Walter, Daniel and Walther, Andrea and Weiser, Martin}, publisher = {De Gruyter}, arxiv = {http://arxiv.org/abs/2404.01864}, doi = {10.1515/9783111376776-005}, pages = {59 -- 78}, year = {2025}, abstract = {Generating simulated training data needed for constructing sufficiently accurate surrogate models to be used for efficient optimization or parameter identification can incur a huge computational effort in the offline phase. We consider a fully adaptive greedy approach to the computational design of experiments problem using gradient-enhanced Gaussian process regression as surrogates. Designs are incrementally defined by solving an optimization problem for accuracy given a certain computational budget. We address not only the choice of evaluation points but also of required simulation accuracy, both of values and gradients of the forward model. Numerical results show a significant reduction of the computational effort compared to just position-adaptive and static designs as well as a clear benefit of including gradient information into the surrogate training.}, language = {en} } @book{DeuflhardWeiser2012, author = {Deuflhard, Peter and Weiser, Martin}, title = {Adaptive numerical solution of PDEs}, publisher = {de Gruyter}, address = {Berlin}, year = {2012}, language = {en} } @misc{NadobnyWeihrauchWeiseretal.2007, author = {Nadobny, Johanna and Weihrauch, Mirko and Weiser, Martin and Gellermann, Johanna and Wlodarczyk, Waldemar and Budach, Volker and Wust, Peter}, title = {Advances in the Planning and Control of the MR-guided Regional Hyperthermia Applications}, journal = {Proc. Int. Conf. Electromagnetics in Advanced Applications, ICEAA 2007, Torino, Italy}, pages = {1010 -- 1013}, year = {2007}, language = {en} } @misc{WeiserDeuflhardErdmann2004, author = {Weiser, Martin and Deuflhard, Peter and Erdmann, Bodo}, title = {Affine conjugate adaptive Newton methods for nonlinear elastomechanics}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7768}, number = {04-01}, year = {2004}, abstract = {The paper extends affine conjugate Newton methods from convex to nonconvex minimization, with particular emphasis on PDE problems originating from compressible hyperelasticity. Based on well-known schemes from finite dimensional nonlinear optimization, three different algorithmic variants are worked out in a function space setting, which permits an adaptive multilevel finite element implementation. These algorithms are tested on two well-known 3D test problems and a real-life example from surgical operation planning.}, language = {en} } @article{WeiserDeuflhardErdmann2007, author = {Weiser, Martin and Deuflhard, Peter and Erdmann, Bodo}, title = {Affine conjugate adaptive Newton methods for nonlinear elastomechanics}, volume = {22}, journal = {Opt. Meth. Softw.}, number = {3}, pages = {413 -- 431}, year = {2007}, language = {en} } @article{VolkweinWeiser2002, author = {Volkwein, S. and Weiser, Martin}, title = {Affine Invariant Convergence Analysis for Inexact Augmented Lagrangian SQP Methods}, volume = {41}, journal = {SIAM J. Control Optim.}, number = {3}, pages = {875 -- 899}, year = {2002}, language = {en} } @misc{VolkweinWeiser2000, author = {Volkwein, Stefan and Weiser, Martin}, title = {Affine Invariant Convergence Analysis for Inexact Augmented Lagrangian-SQP Methods}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6243}, number = {00-56}, year = {2000}, abstract = {An affine invariant convergence analysis for inexact augmented Lagrangian-SQP methods is presented. The theory is used for the construction of an accuracy matching between iteration errors and truncation errors, which arise from the inexact linear system solves. The theoretical investigations are illustrated numerically by an optimal control problem for the Burgers equation.}, language = {en} } @misc{LubkollSchielaWeiser2015, author = {Lubkoll, Lars and Schiela, Anton and Weiser, Martin}, title = {An affine covariant composite step method for optimization with PDEs as equality constraints}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-53954}, year = {2015}, abstract = {We propose a composite step method, designed for equality constrained optimization with partial differential equations. Focus is laid on the construction of a globalization scheme, which is based on cubic regularization of the objective and an affine covariant damped Newton method for feasibility. We show finite termination of the inner loop and fast local convergence of the algorithm. We discuss preconditioning strategies for the iterative solution of the arising linear systems with projected conjugate gradient. Numerical results are shown for optimal control problems subject to a nonlinear heat equation and subject to nonlinear elastic equations arising from an implant design problem in craniofacial surgery.}, language = {en} }