IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v60y2015i3p753-787.html
   My bibliography  Save this article

Certified PDE-constrained parameter optimization using reduced basis surrogate models for evolution problems

Author

Listed:
  • Markus Dihlmann
  • Bernard Haasdonk

Abstract

We consider parameter optimization problems which are subject to constraints given by parametrized partial differential equations. Discretizing this problem may lead to a large-scale optimization problem which can hardly be solved rapidly. In order to accelerate the process of parameter optimization we will use a reduced basis surrogate model for numerical optimization. For many optimization methods sensitivity information about the functional is needed. In the following we will show that this derivative information can be calculated efficiently in the reduced basis framework in the case of a general linear output functional and parametrized evolution problems with linear parameter separable operators. By calculating the sensitivity information directly instead of applying the more widely used adjoint approach we can rapidly optimize different cost functionals using the same reduced basis model. Furthermore, we will derive rigorous a-posteriori error estimators for the solution, the gradient and the optimal parameters, which can all be computed online. The method will be applied to two parameter optimization problems with an underlying advection-diffusion equation. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • Markus Dihlmann & Bernard Haasdonk, 2015. "Certified PDE-constrained parameter optimization using reduced basis surrogate models for evolution problems," Computational Optimization and Applications, Springer, vol. 60(3), pages 753-787, April.
  • Handle: RePEc:spr:coopap:v:60:y:2015:i:3:p:753-787
    DOI: 10.1007/s10589-014-9697-1
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-014-9697-1
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10589-014-9697-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. F. Tröltzsch & S. Volkwein, 2009. "POD a-posteriori error estimates for linear-quadratic optimal control problems," Computational Optimization and Applications, Springer, vol. 44(1), pages 83-115, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dominik Garmatter & Margherita Porcelli & Francesco Rinaldi & Martin Stoll, 2023. "An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations," Computational Optimization and Applications, Springer, vol. 84(1), pages 191-223, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Christian Jörres & Georg Vossen & Michael Herty, 2013. "On an inexact gradient method using Proper Orthogonal Decomposition for parabolic optimal control problems," Computational Optimization and Applications, Springer, vol. 55(2), pages 459-468, June.
    2. Martin Gubisch & Stefan Volkwein, 2014. "POD a-posteriori error analysis for optimal control problems with mixed control-state constraints," Computational Optimization and Applications, Springer, vol. 58(3), pages 619-644, July.
    3. S. Volkwein, 2010. "Admittance Identification from Point-wise Sound Pressure Measurements Using Reduced-order Modelling," Journal of Optimization Theory and Applications, Springer, vol. 147(1), pages 169-193, October.
    4. A. El Hamidi & H. Ossman & M. Jazar, 2017. "On the convergence of alternating minimization methods in variational PGD," Computational Optimization and Applications, Springer, vol. 68(2), pages 455-472, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:60:y:2015:i:3:p:753-787. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.