Inexact Trust-Region Methods for PDE-Constrained Optimization
Numerical solution of optimization problems with partial differential equation (PDE) constraints typically requires inexact objective function and constraint evaluations, derivative approximations, and the use of iterative linear system solvers. Over the last 30 years, trust-region methods have been extended to rigorously, robustly, and efficiently handle various sources of inexactness in the optimization process. In this chapter, we review some of the recent advances, discuss their key algorithmic contributions, and present numerical examples that demonstrate how inexact computations can be exploited to enable the solution of large-scale PDE-constrained optimization problems.
This work was supported by DARPA EQUiPS grant SNL 014150709 and the DOE NNSA ASC ATDM program.
Sandia National Laboratories is a multimission laboratory managed and operated by National Technology and Engineering Solutions of Sandia LLC, a wholly owned subsidiary of Honeywell International Inc. for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525. This paper describes objective technical results and analysis. Any subjective views or opinions that might be expressed in the paper do not necessarily represent the views of the U.S. Department of Energy or the United States Government.
- 1.N. Alexandrov. Robustness properties of a trust-region framework for managing approximation models in engineering optimization. In Proceedings from the AIAA/USAF/NASA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, Work-in-progress Paper AIAA–96–4102-CP, pages 1056–1059, 1996.Google Scholar
- 2.N. Alexandrov. A trust–region framework for managing approximations in constrained optimization problems. In Proceedings of the First ISSMO/NASA Internet Conference on Approximation and Fast Reanalysis Techniques in Engineering Optimization, June 14–27, 1998, 1998.Google Scholar
- 3.N. Alexandrov and J. E. Dennis. Multilevel algorithms for nonlinear optimization. In J. Borggaard, J. Burkardt, M. D. Gunzburger, and J. Peterson, editors, Optimal Design and Control, pages 1–22, Basel, Boston, Berlin, 1995. Birkhäuser Verlag.Google Scholar
- 4.N. Alexandrov, J. E. Dennis Jr., R. M. Lewis, and V. Torczon. A trust region framework for managing the use of approximation models in optimization. Structural Optimization, 15: 16–23, 1998. Appeared also as ICASE report 97–50.Google Scholar
- 5.E. Arian, M. Fahl, and E. W. Sachs. Trust–region proper orthogonal decomposition for flow control. Technical Report 2000–25, ICASE, NASA Langley Research Center, Hampton VA 23681–2299, 2000.Google Scholar
- 7.V. Barthelmann, E. Novak, and K. Ritter. High dimensional polynomial interpolation on sparse grids. Adv. Comput. Math., 12(4):273–288, 2000. Multivariate polynomial interpolation.Google Scholar
- 10.R. G. Carter. Numerical optimization in Hilbert space using inexact function and gradient evaluations. Technical Report 89–45, ICASE, Langley, VA, 1989.Google Scholar
- 15.J. E. Dennis and V. Torczon. Approximation model managemet for optimization. In Proceedings from the AIAA/USAF/NASA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, Work-in-progress Paper AIAA–96–4099-CP, pages 1044–1046, 1996.Google Scholar
- 16.J. E. Dennis and V. Torczon. Managing approximation models in optimization. In N. Alexandrov and M. Y. Hussaini, editors, Multidisciplinary Design Optimization. State of the Art, pages 330–347, Philadelphia, 1997. SIAM.Google Scholar
- 18.M. Fahl and E.W. Sachs. Reduced order modelling approaches to PDE–constrained optimization based on proper orthogonal decompostion. In L. T. Biegler, O. Ghattas, M. Heinkenschloss, and B. van Bloemen Waanders van Bloemen Waanders, editors, Large-Scale PDE-Constrained Optimization, Lecture Notes in Computational Science and Engineering, Vol. 30, Heidelberg, 2003. Springer-Verlag.Google Scholar
- 27.D. P. Kouri, G. von Winckel, and D. Ridzal. ROL: Rapid Optimization Library. https://trilinos.org/packages/rol, 2017.
- 29.J. J. Moré. Recent developments in algorithms and software for trust region methods. In A. Bachem, M. Grötschel, and B. Korte, editors, Mathematical Programming, The State of The Art, pages 258–287. Springer Verlag, Berlin, Heidelberg, New-York, 1983.Google Scholar
- 32.E. O. Omojokun. Trust region algorithms for optimization with nonlinear equality and inequality constraints. PhD thesis, Department of Computer Science, University of Colorado, Boulder, Colorado, 1989.Google Scholar
- 36.D. Ridzal. Preconditioning of a Full-Space Trust-Region SQP Algorithm for PDE-constrained Optimization. In Report No. 04/2013: Numerical Methods for PDE Constrained Optimization with Uncertain Data. Mathematisches Forschungsinstitut Oberwolfach, 2013.Google Scholar
- 37.S. A. Smoljak. Quadrature and interpolation formulae on tensor products of certain function classes. Soviet Math. Dokl., 4:240–243, 1963.Google Scholar