Location of Repository

An adjoint for likelihood maximization

By David J.J. Toal, Alexander I.J. Forrester, Neil W. Bressloff, Andy J. Keane and Carren Holden

Abstract

The process of likelihood maximization can be found in many different areas of computational modelling. However, the construction of such models via likelihood maximization requires the solution of a difficult multi-modal optimization problem involving an expensive O(n3) factorization. The optimization techniques used to solve this problem may require many such factorizations and can result in a significant bottle-neck. This article derives an adjoint formulation of the likelihood employed in the construction of a kriging model via reverse algorithmic differentiation. This adjoint is found to calculate the likelihood and all of its derivatives more efficiently than the standard analytical method and can therefore be utilised within a simple local search or within a hybrid global optimization to accelerate convergence and therefore reduce the cost of the likelihood optimization

Topics: QA
Year: 2009
OAI identifier: oai:eprints.soton.ac.uk:71661
Provided by: e-Prints Soton

Suggested articles

Preview

Citations

  1. (2006). A Hybrid PSO-GD Based Intelligent Method for Machine Diagnosis. doi
  2. (1951). A statistical Approach to Some Basic Mine Valuation Problems on the Witwatersrand.
  3. (2001). A Taxonomy of Global Optimization Methods Based on Response Surfaces.
  4. (2008). ADjoint: An Approach for the Rapid Development of Discrete Adjoint Solvers. doi
  5. (2001). Article submitted to Royal Society20
  6. (2005). Computational Approaches for Aerospace Design, doi
  7. (2006). Design and Analysis of \Noisy" Computer Experiments. doi
  8. (1995). Di®erentiation of the Cholesky Algorithm.
  9. (2001). E±cient Computation of Maximum Likelihood Estimators in a Spatial Linear Model with Power Exponential Covariogram. doi
  10. (2008). Engineering Design via Surrogate Modelling, doi
  11. (2000). Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, doi
  12. (2005). Exploiting Hessian Matrix and Trust-Region Algorithm in Hyperparameter Estimation of Gaussian Process. doi
  13. (2003). Gaussian Process Meta-Modelling: Comparison of Gaussian Process Training Methods. doi
  14. (2008). Geometric Filtration Using POD for Aerodynamic Design Optimization. Collection of Technical Papers doi
  15. (2008). Kriging Hyperparameter Tuning Strategies. doi
  16. (1994). Matrix Inversion Algorithms by Means of Automatic Di®erentiation. doi
  17. (2001). Metamodels for Computerbased Engineering Design: Survey and Recommendations. doi
  18. (2005). Multi-Objective Evolutionary Optimization of Subsonic Airfoils by Kriging Approximation and Evolution Control. doi
  19. (2006). Optimization Using Surrogate Models and Part Converged Computational Fluid Dynamics Simulations. doi
  20. (2006). Sequential Kriging Optimization Using Multiple-Fidelity Evaluations. Structural and Mulitdisciplinary optimization 32, doi
  21. (2006). Statistical Improvement Criteria for Use in Mulitobjective Design Optimization. doi
  22. (2003). Structural Optimization Using Kriging Approximation. doi
  23. (2005). Surrogate-Based Analysis and Optimization. doi
  24. (1970). The Convergence of a Class of Double-rank Minimization Algorithms. doi
  25. (2007). The Matrix Cookbook Press,
  26. (2006). Update Strategies for Kriging Models Used in Variable Fidelity Optimization. Structural and Mulitdisciplinary optimization, doi
  27. (2005). Use of Kriging Models to Approximate Deterministic Computer Models. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.