Full Article - Open Access.

Idioma principal


Wilke, D. N.; Kok, S.;

Full Article:

This study considers the numerical sensitivity calculation for discontinuous gradientonly optimization problems using the complex-step method. The complex-step method was initially introduced to differentiate analytical functions in the late 1960s, and is based on a Taylor series expansion using a pure imaginary step. The complex-step method is not subject to subtraction errors as with finite difference approaches when computing first order sensitivities and therefore allows for much smaller step sizes that ultimately yields accurate sensitivities. This study investigates the applicability of the complex-step method to numerically compute first order sensitivity information for discontinuous optimization problems. An attractive feature of the complex-step approach is that no real difference step is taken as with conventional finite difference approaches, since conventional finite differences are problematic when real steps are taken over a discontinuity. We highlight the benefits and disadvantages of the complex-step method in the context of discontinuous gradient-only optimization problems that result from numerically approximated (partial) differential equations. Gradient-only optimization is a recently proposed alternative to mathematical programming for solving discontinuous optimization problems. Gradient-only optimization was initially proposed to solve shape optimization problems that utilise remeshing (i.e. the mesh topology is allowed to change) between design updates. Here, changes in mesh topology result in abrupt changes in the discretization error of the computed response. These abrupt changes in turn manifests as discontinuities in the numerically computed objective and constraint functions of an optimization problem. These discontinuities are in particular problematic when they manifest as local minima. Note that these potential issues are not limited to problems in shape optimization but may be present whenever (partial) differential equations are approximated numerically with non-constant discretization methods e.g. remeshing of spatial domains or automatic time stepping in temporal domains.

Full Article:

Palavras-chave: Complex-step derivative, Discontinuous function, Gradient-only optimization.,


DOI: 10.5151/meceng-wccm2012-19508

Referências bibliográficas
  • [1] Cerviño L., Bewley T., “On the extension of the complex-step derivative technique to pseudospectral algorithms”. J. Comput. Phys. 187, 544-549, 2003.
  • [2] van Keulen F., Haftka R., Kim N., “Review of options for structural design sensitivity analysis Part 1 : Linear systems”. Comput. Method. Appl. M. 194, 3213-3243, 2005.
  • [3] Kim J., Bates D., Postlethwaite I., “Nonlinear robust performance analysis using complex-step gradient approximation”. Automatica 42, 177-182, 2006.
  • [4] Kim S., Ryu J., Cho M., “Numerically generated tangent stiffness matrices using the complex variable derivative method for nonlinear structural analysiss”. Comput. Method. Appl. M. 200, 403-413, 2011.
  • [5] Lai K.L., Crassidis J., ‘Generalizations of the complex-step derivative approximation”. Coll. Tech. Papers: AIAA Guid. Nav. Contrl. Conf. 4, 2540-2564, 2006.
  • [6] Laporte E., Tallec P.L., Numerical Methods in Sensitivity Analysis and Shape Optimization. Modeling and Simulation in Science, Birkhäuser, 2002.
  • [7] Lyness J., “Differentiation formulas for analytic functions”. Math. Comput. 22, 352-362, 1968.
  • [8] Lyness J., Moler C., “Numerical Differentiation of Analytic Functions”. SIAM J. Numer. Anal. 4, 202-210,1967.
  • [9] Martins J., Sturdza P., Alonso J.J., “The Complex-Step Derivative Approximation”. ACM T. Math. Software 29, 245-262, 2003.
  • [10] Martins J., Alonso J., Reuther J., “A Coupled-Adjoint Sensitivity Analysis Method for High-Fidelity Aero-Structural Design”. Optim. Eng. 6, 33-62, 2005.
  • [11] Martins J.R.R.A., Sturdza P., Alonso J.J., “The connection between the complex-step derivative approximation and algorithmic differentiation”. AIAA Paper 921, 1-11, 2001.
  • [12] Schleupen A., Maute K., Ramm E., “Adaptive FE-procedures in shape optimization”. Struct. Multidiscip. O. 19, 282-302, 2000.
  • [13] Shor N., “New development trends in nondifferentiable optimization”. Cybern. Syst. Anal+ 13, 881-886, 1977.
  • [14] Squire M., Trapp G., “Using Complex Variables to estimate derivatives of real functions”. SIAM Rev. 40, 110-112, 1998.
  • [15] Vatsa V., “Computation of sensitivity derivatives of Navier-Stokes equations using complex variables”. Adv. Eng. Softw. 31, 655-659, 2000.
  • [16] Voorhees A., Millwater H., Bagley R., “Complex variable methods for shape sensitivity of finite element methods”. Finite Elem. Anal. Des. 47, 1146-1156, 2011.
  • [17] Voorhees A., Millwater H., Bagley R., Golden P., “Fatigue sensitivity analysis using complex variable methods”. Int. J. Fatigue 40, 61-73, 2012.
  • [18] Wilke D.N., Kok S., Snyman J.A., Groenwold A.A., “Gradient-only approaches to avoid spurious local minima in unconstrained optimization”. Opt. Eng. available online, 2012.
Como citar:

Wilke, D. N.; Kok, S.; "NUMERICAL SENSITIVITY COMPUTATION FOR DISCONTINUOUS GRADIENT-ONLY OPTIMIZATION PROBLEMS USING THE COMPLEX-STEP METHOD", p. 3665-3676 . In: In Proceedings of the 10th World Congress on Computational Mechanics [= Blucher Mechanical Engineering Proceedings, v. 1, n. 1]. São Paulo: Blucher, 2014.
ISSN 2358-0828, DOI 10.5151/meceng-wccm2012-19508

últimos 30 dias | último ano | desde a publicação