A PDE-constrained optimization approach to the discontinuous Petrov-Galerkin method with a trust region inexact Newton-CG solver

被引:9
|
作者
Bui-Thanh, Tan [1 ]
Ghattas, Omar [2 ]
机构
[1] Univ Texas Austin, Inst Computat Engn & Sci, Dept Aerosp Engn & Engn Mech, Austin, TX 78712 USA
[2] Univ Texas Austin, Dept Mech Engn, Inst Computat Engn & Sci, Jackson Sch Geosci, Austin, TX 78712 USA
关键词
Discontinuous Petrov-Galerkin methods; Trust region inexact Newton conjugated gradient method; Forward equation; Adjoint equation; Incremental forward equation; PDE-constrained optimization; ROBUST DPG METHOD;
D O I
10.1016/j.cma.2014.04.018
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We propose a partial-differential-equation-constrained (PDE-constrained) approach to the discontinuous Petrov-Galerkin (DPG) of Demkowicz and Gopalakrishnan (2010, 2011). This view opens the door to invite all the state-of-the-art PDE-constrained techniques to be part of the DPG framework, and hence enabling one to solve large-scale and difficult (nonlinear) problems efficiently. That is, our proposed method preserves all the attractive features of the DPG framework while enjoying all advances from the PDE-constrained optimization community. The proposed approach can be considered as a Rayleigh-Ritz method for the DPG minimum residual statement. It is equipped with a trust region inexact Newton conjugate gradient (TRINCG) method which prevents over-solving when optimization iterates are far away from the optimal solution but converges quadratically otherwise for sufficiently smooth residual. The PDE-constrained approach together with the TRINCG solver is therefore a robust iterative method for the DPG framework. It is robust in the sense that the approximate solution is improved after each optimization iterate until the algorithm converges to a local minimum of the residual. As numerically shown, it is also scalable in the sense that the number of Newton iterations remains constant as either the mesh or the solution order is refined. Moreover, the proposed approach solves neither the optimal test functions nor the original PDE directly, though the discretization of the latter is still necessary. The gradient and Hessian-vector product, which are required by the TRINCG solver, are explicitly derived for both abstract variational problems and viscous Burger equation. This reveals a fact that the complexity of each Newton iteration scales like O (N x n(CG)), where N and nCG are the number of unknowns and the number of conjugate iterations, respectively. Optimal h- and p- convergences of the proposed approach are demonstrated for Laplace and Helmholtz equations. Numerical results for the viscous Burger equation and the Euler equation of gas dynamics are very promising. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:20 / 40
页数:21
相关论文
共 33 条
  • [1] An Inexact Trust-Region SQP Method with Applications to PDE-Constrained Optimization
    Heinkenschloss, M.
    Ridzal, D.
    [J]. NUMERICAL MATHEMATICS AND ADVANCED APPLICATIONS, 2008, : 613 - +
  • [2] A CERTIFIED TRUST REGION REDUCED BASIS APPROACH TO PDE-CONSTRAINED OPTIMIZATION
    Qian, Elizabeth
    Grepl, Martin
    Veroy, Karen
    Willcox, Karen
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2017, 39 (05): : S434 - S460
  • [3] Discretely Exact Derivatives for Hyperbolic PDE-Constrained Optimization Problems Discretized by the Discontinuous Galerkin Method
    Lucas C. Wilcox
    Georg Stadler
    Tan Bui-Thanh
    Omar Ghattas
    [J]. Journal of Scientific Computing, 2015, 63 : 138 - 162
  • [4] INEXACT OBJECTIVE FUNCTION EVALUATIONS IN A TRUST-REGION ALGORITHM FOR PDE-CONSTRAINED OPTIMIZATION UNDER UNCERTAINTY
    Kouri, D. P.
    Heinkenschloss, M.
    Ridzal, D.
    Waanders, B. G. Van Bloemen
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2014, 36 (06): : A3011 - A3029
  • [5] Discretely Exact Derivatives for Hyperbolic PDE-Constrained Optimization Problems Discretized by the Discontinuous Galerkin Method
    Wilcox, Lucas C.
    Stadler, Georg
    Bui-Thanh, Tan
    Ghattas, Omar
    [J]. JOURNAL OF SCIENTIFIC COMPUTING, 2015, 63 (01) : 138 - 162
  • [6] A smoothing trust-region Newton-CG method for minimax problem
    Ye, Feng
    Liu, Hongwei
    Zhou, Shuisheng
    Liu, Sanyang
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2008, 199 (02) : 581 - 589
  • [7] INEXACT INTERIOR-POINT METHOD FOR PDE-CONSTRAINED NONLINEAR OPTIMIZATION
    Grote, Marcus J.
    Huber, Johannes
    Kourounis, Drosos
    Schenk, Olaf
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2014, 36 (03): : A1251 - A1276
  • [8] A path-following inexact Newton method for PDE-constrained optimal control in BV
    D. Hafemeyer
    F. Mannel
    [J]. Computational Optimization and Applications, 2022, 82 : 753 - 794
  • [9] A path-following inexact Newton method for PDE-constrained optimal control in BV
    Hafemeyer, D.
    Mannel, F.
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 82 (03) : 753 - 794
  • [10] A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees
    O'Neill, Michael
    Wright, Stephen J.
    [J]. IMA JOURNAL OF NUMERICAL ANALYSIS, 2021, 41 (01) : 84 - 121