Progressive construction of a parametric reduced-order model for PDE-constrained optimization

An adaptive approach to using reduced-order models as surrogates in PDE-constrained optimization is introduced that breaks the traditional offline-online framework of model order reduction. A sequence of optimization problems constrained by a given Reduced-Order Model (ROM) is defined with the goal of converging to the solution of a given PDE-constrained optimization problem. For each reduced optimization problem, the constraining ROM is trained from sampling the High-Dimensional Model (HDM) at the solution of some of the previous problems in the sequence. The reduced optimization problems are equipped with a nonlinear trust-region based on a residual error indicator to keep the optimization trajectory in a region of the parameter space where the ROM is accurate. A technique for incorporating sensitivities into a Reduced-Order Basis (ROB) is also presented, along with a methodology for computing sensitivities of the reduced-order model that minimizes the distance to the corresponding HDM sensitivity, in a suitable norm. The proposed reduced optimization framework is applied to subsonic aerodynamic shape optimization and shown to reduce the number of queries to the HDM by a factor of 4-5, compared to the optimization problem solved using only the HDM, with errors in the optimal solution far less than 0.1%

Expedited Design Closure of Antenna Input Characteristics by Trust Region Gradient Search and Principal Component Analysis

Publisher's version (útgefin grein)Optimization-based parameter tuning has become an inherent part of contemporary antenna design process. For the sake of reliability, it is typically conducted at the level of full-wave electromagnetic (EM) simulation models. This may incur considerable computational expenses depending on the cost of an individual EM analysis, the number of adjustable variables, the type of task (local, global, single-/multi-objective optimization), and the constraints involved. For these reasons, utilization of conventional algorithms is often impractical. This paper proposes a novel gradient-based algorithm with numerical derivatives for expedited antenna optimization. The improvement of computational efficiency is obtained by employing a rank-one Broyden formula and restricting finite differentiation sensitivity updates to the principal directions of the Jacobian matrix, i.e., those corresponding to the most significant changes of the antenna responses. Comprehensive numerical validation carried out using three wideband antennas indicates that the presented methodology offers considerable savings of sixty percent with respect to the reference trust-region algorithm. At the same time, virtually no degradation of the design quality is observed. Furthermore, algorithm reliability is greatly improved (while offering comparable computational efficiency) over the recent state-of-the-art accelerated gradient-based procedures.The Icelandic Centre for Research (RANNIS) Grant 174114051, and in part by the National Science Centre of Poland Grant 2015/17/B/ST6/01857."Peer Reviewed

Refraction-corrected ray-based inversion for three-dimensional ultrasound tomography of the breast

Ultrasound Tomography has seen a revival of interest in the past decade, especially for breast imaging, due to improvements in both ultrasound and computing hardware. In particular, three-dimensional ultrasound tomography, a fully tomographic method in which the medium to be imaged is surrounded by ultrasound transducers, has become feasible. In this paper, a comprehensive derivation and study of a robust framework for large-scale bent-ray ultrasound tomography in 3D for a hemispherical detector array is presented. Two ray-tracing approaches are derived and compared. More significantly, the problem of linking the rays between emitters and receivers, which is challenging in 3D due to the high number of degrees of freedom for the trajectory of rays, is analysed both as a minimisation and as a root-finding problem. The ray-linking problem is parameterised for a convex detection surface and three robust, accurate, and efficient ray-linking algorithms are formulated and demonstrated. To stabilise these methods, novel adaptive-smoothing approaches are proposed that control the conditioning of the update matrices to ensure accurate linking. The nonlinear UST problem of estimating the sound speed was recast as a series of linearised subproblems, each solved using the above algorithms and within a steepest descent scheme. The whole imaging algorithm was demonstrated to be robust and accurate on realistic data simulated using a full-wave acoustic model and an anatomical breast phantom, and incorporating the errors due to time-of-flight picking that would be present with measured data. This method can used to provide a low-artefact, quantitatively accurate, 3D sound speed maps. In addition to being useful in their own right, such 3D sound speed maps can be used to initialise full-wave inversion methods, or as an input to photoacoustic tomography reconstructions

Expedited Feature-Based Quasi-Global Optimization of Multi-Band Antenna Input Characteristics With Jacobian Variability Tracking

Publisher's version (útgefin grein)Design of modern antennas relies-for reliability reasons-on full-wave electromagnetic simulation tools. In addition, increasingly stringent specifications pertaining to electrical and field performance, growing complexity of antenna topologies, along with the necessity for handling multiple objectives, make numerical optimization of antenna geometry parameters a highly recommended design procedure. Conventional algorithms, particularly global ones, entail often-unmanageable computational costs, so alternative approaches are needed. This work proposes a novel method for cost-efficient globalized design optimization of multi-band antennas incorporating the response feature technology into the trust-region framework. It allows for unequivocal allocation of the antenna resonances even for poor initial designs, where conventional local algorithms fail. Furthermore, the algorithm is accelerated by means of Jacobian variability tracking, which reduces the number of expensive finite-differentiation updates. Two real-world antenna design cases are used for demonstration purposes. The optimization cost is comparable to that of local routines while ensuring nearly global search capabilities.This work was supported in part by the Icelandic Centre for Research (RANNIS) under Grant 206606051, and in part by the National Science Centre of Poland under Grant 2017/27/B/ST7/00563."Peer Reviewed