@article{Weiser2013, author = {Weiser, Martin}, title = {On goal-oriented adaptivity for elliptic optimal control problems}, volume = {28}, journal = {Opt. Meth. Softw.}, number = {13}, pages = {969 -- 992}, year = {2013}, abstract = {The paper proposes goal-oriented error estimation and mesh refinement for optimal control problems with elliptic PDE constraints using the value of the reduced cost functional as quantity of interest. Error representation, hierarchical error estimators, and greedy-style error indicators are derived and compared to their counterparts when using the all-at-once cost functional as quantity of interest. Finally, the efficiency of the error estimator and generated meshes are demonstrated on numerical examples.}, language = {en} } @article{DeuflhardSchielaWeiser2012, author = {Deuflhard, Peter and Schiela, Anton and Weiser, Martin}, title = {Mathematical Cancer Therapy Planning in Deep Regional Hyperthermia}, volume = {21}, journal = {Acta Numerica}, pages = {307 -- 378}, year = {2012}, abstract = {This paper surveys the required mathematics for a typical challenging problem from computational medicine, the cancer therapy planning in deep regional hyperthermia. In the course of many years of close cooperation with clinics, the medical problem gave rise to quite a number of subtle mathematical problems, part of which had been unsolved when the common project started. Efficiency of numerical algorithms, i.e. computational speed and monitored reliability, play a decisive role for the medical treatment. Off-the-shelf software had turned out to be not sufficient to meet the requirements of medicine. Rather, new mathematical theory as well as new numerical algorithms had to be developed. In order to make our algorithms useful in the clinical environment, new visualization software, a virtual lab, including 3D geometry processing of individual virtual patients had to be designed and implemented. Moreover, before the problems could be attacked by numerical algorithms, careful mathematical modelling had to be done. Finally, parameter identification and constrained optimization for the PDEs had to be newly analyzed and realized over the individual patient's geometry. Our new techniques had an impact on the specificity of the individual patients' treatment and on the construction of an improved hyperthermia applicator.}, language = {en} } @article{LubkollSchielaWeiser2014, author = {Lubkoll, Lars and Schiela, Anton and Weiser, Martin}, title = {An optimal control problem in polyconvex hyperelasticity}, volume = {52}, journal = {SIAM J. Control Opt.}, number = {3}, doi = {10.1137/120876629}, pages = {1403 -- 1422}, year = {2014}, abstract = {We consider a shape implant design problem that arises in the context of facial surgery. We introduce a reformulation as an optimal control problem, where the control acts as a boundary force. The state is modelled as a minimizer of a polyconvex hyperelastic energy functional. We show existence of optimal solutions and derive - on a formal level - first order optimality conditions. Finally, preliminary numerical results are presented.}, language = {en} } @misc{SchielaWeiser2010, author = {Schiela, Anton and Weiser, Martin}, title = {Barrier methods for a control problem from hyperthermia treatment planning}, journal = {Recent Advances in Optimization and its Applications in Engineering (Proceedings of 14th Belgian-French-German Conference on Optimization 2009)}, editor = {Diehl, M. and Glineur, F. and Jarlebring, E. and Michiels, W.}, publisher = {Springer}, pages = {419 -- 428}, year = {2010}, abstract = {We consider an optimal control problem from hyperthermia treatment planning and its barrier regularization. We derive basic results, which lay the groundwork for the computation of optimal solutions via an interior point path-following method. Further, we report on a numerical implementation of such a method and its performance at an example problem.}, language = {en} } @article{LubkollSchielaWeiser2017, author = {Lubkoll, Lars and Schiela, Anton and Weiser, Martin}, title = {An affine covariant composite step method for optimization with PDEs as equality constraints}, volume = {32}, journal = {Optimization Methods and Software}, number = {5}, doi = {10.1080/10556788.2016.1241783}, pages = {1132 -- 1161}, year = {2017}, 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} } @misc{SchenkWaechterWeiser2007, author = {Schenk, Olaf and W{\"a}chter, Andreas and Weiser, Martin}, title = {Inertia Revealing Preconditioning For Large-Scale Nonconvex Constrained Optimization}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-10314}, number = {07-32}, year = {2007}, abstract = {Fast nonlinear programming methods following the all-at-once approach usually employ Newton's method for solving linearized Karush-Kuhn-Tucker (KKT) systems. In nonconvex problems, the Newton direction is only guaranteed to be a descent direction if the Hessian of the Lagrange function is positive definite on the nullspace of the active constraints, otherwise some modifications to Newton's method are necessary. This condition can be verified using the signs of the KKT's eigenvalues (inertia), which are usually available from direct solvers for the arising linear saddle point problems. Iterative solvers are mandatory for very large-scale problems, but in general do not provide the inertia. Here we present a preconditioner based on a multilevel incomplete \$LBL^T\$ factorization, from which an approximation of the inertia can be obtained. The suitability of the heuristics for application in optimization methods is verified on an interior point method applied to the CUTE and COPS test problems, on large-scale 3D PDE-constrained optimal control problems, as well as 3D PDE-constrained optimization in biomedical cancer hyperthermia treatment planning. The efficiency of the preconditioner is demonstrated on convex and nonconvex problems with \$150^3\$ state variables and \$150^2\$ control variables, both subject to bound constraints.}, language = {en} } @misc{GriesseWeiser2005, author = {Griesse, Roland and Weiser, Martin}, title = {On the Interplay Between Interior Point Approximation and Parametric Sensitivities in Optimal Control}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8773}, number = {05-44}, year = {2005}, abstract = {This paper is concerned with the sensitivities of function space oriented interior point approximations in parameter dependent problems. For an abstract setting that covers control constrained optimal control problems, the convergence of interior point sensitivities to the sensitivities of the optimal solution is shown. Error bounds for \$L_q\$ norms are derived and illustrated with numerical examples.}, language = {en} } @inproceedings{BaumannNoackSteinke2021, author = {Baumann, Tobias and Noack, Matthias and Steinke, Thomas}, title = {Performance Evaluation and Improvements of the PoCL Open-Source OpenCL Implementation on Intel CPUs}, booktitle = {IWOCL'21: International Workshop on OpenCL}, doi = {10.1145/3456669.3456698}, year = {2021}, abstract = {The Portable Computing Language (PoCL) is a vendor independent open-source OpenCL implementation that aims to support a variety of compute devices in a single platform. Evaluating PoCL versus the Intel OpenCL implementation reveals significant performance drawbacks of PoCL on Intel CPUs - which run 92 \% of the TOP500 list. Using a selection of benchmarks, we identify and analyse performance issues in PoCL with a focus on scheduling and vectorisation. We propose a new CPU device-driver based on Intel Threading Building Blocks (TBB), and evaluate LLVM with respect to automatic compiler vectorisation across work-items in PoCL. Using the TBB driver, it is possible to narrow the gap to Intel OpenCL and even outperform it by a factor of up to 1.3× in our proxy application benchmark with a manual vectorisation strategy.}, language = {en} }