Abstract
Sequential quadratic programming and interior point methods are effective general purpose optimization algorithms that sometimes exhibit poor performance in topology optimization applications. We postulate that this performance behavior stems from the frequent failure of BFGS updates for common topology optimization problem formulations that reduces the effectiveness of the resulting Hessian approximations. To address this issue, we propose a computationally efficient correction technique that utilizes problem-specific second-order derivative information to remove negative curvature contributions and achieve better overall optimizer performance. The proposed technique is tested on compliance and natural frequency topology optimization problem sets and compared against the quasi-Newton optimizers ParOpt, IPOPT, and SNOPT with the BFGS and SR1 Hessian approximations, as well as MMA. The results show that the optimizer with the proposed correction produces optimized designs in fewer function evaluations with either lower or competitive objective and discreteness metric values compared to other quasi-Newton based optimizers. Finally, scalability of the implementation is demonstrated by solving large-scale problems that have up to 96.9 million degrees of freedom with adaptively refined meshes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aage N, Andreassen E, Lazarov BS (2015) Topology optimization using PETSc: an easy-to-use, fully parallel, open source topology optimization framework. Struct Multidisc Optim 51(3):565–572. https://doi.org/10.1007/s00158-014-1157-0
Addis B, Cassioli A, Locatelli M, Schoen F (2011) A global optimization method for the design of space trajectories. Comput Optim Appl 48(3):635–652. https://doi.org/10.1007/s10589-009-9261-6
Al-Baali M, Grandinetti L, Pisacane O (2014) Damped techniques for the limited memory BFGS method for large-scale optimization. J Optim Theory Appl 161(2):688–699. https://doi.org/10.1007/s10957-013-0448-8
An LTH, Tao PD (2005) The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann Oper Res 133(1):23–46. https://doi.org/10.1007/s10479-004-5022-1
Becker S, Fadili J, Ochs P (2019) On quasi-newton forward-backward splitting: proximal calculus and convergence. SIAM J Optim 29(4):2445–2481. https://doi.org/10.1137/18M1167152
Bendsøe MP, Sigmund O (2003) Topology optimization: theory, methods and applications. Springer, New York
Bletzinger KU (1993) Extended method of moving asymptotes based on second-order information. Struct Optim 5(3):175–183. https://doi.org/10.1007/BF01743354
Broyden CG (1967) Quasi-newton methods and their application to function minimisation. Math Comput 21:368–381
Byrd RH, Nocedal J, Yuan Y-X (1987) Global convergence of a cass of quasi-Newton methods on convex problems. SIAM J Numer Anal 24(5):1171–1190. https://doi.org/10.1137/0724077
Byrd RH, Nocedal J, Schnabel RB (1994) Representations of quasi-Newton matrices and their use in limited memory methods. Math Program 63(1–3):129–156. https://doi.org/10.1007/BF01582063
Chen X, Qi H, Qi L, Teo K-L (2004) Smooth convex approximation to the maximum eigenvalue function. J Glob Optim 30(2):253–270. https://doi.org/10.1007/s10898-004-8271-2
Chin TW, Leader MK, Kennedy GJ (2019) A scalable framework for large-scale 3d multimaterial topology optimization with octree-based mesh adaptation. Adv Eng Softw 135:102682. https://doi.org/10.1016/j.advengsoft.2019.05.004
Davidon WC (1959) Variable metric method for minimization. Technical report, Argonne National Lab. https://www.osti.gov/biblio/4252678
Deaton JD, Grandhi RV (2014) A survey of structural and multidisciplinary continuum topology optimization: post 2000. Struct Multidisc Optim 49(1):1–38. https://doi.org/10.1007/s00158-013-0956-z
Gill PE, Murray W, Saunders MA (2005) SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev 47(1):99–131. https://doi.org/10.1137/S0036144504446096
Gould NI, Orban D, Toint PL (2003) CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Trans Math Softw 29(4):373–394. https://doi.org/10.1145/962437.962439
Haimes R, Drela M (2012) On the construction of aircraft conceptual geometry for high-fidelity analysis and design. In: 50th AIAA aerospace sciences meeting including the new horizons forum and aerospace exposition, aerospace sciences meetings. American Institute of Aeronautics and Astronautics. https://doi.org/10.2514/6.2012-683
Hassani B, Hinton E (1998) A review of homogenization and topology optimization III-topology optimization using optimality criteria. Comput Struct 69(6):739–756. https://doi.org/10.1016/S0045-7949(98)00133-3
Janka D, Kirches C, Sager S, Wächter A (2016) An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix. Math Program Comput 8(4):435–459. https://doi.org/10.1007/s12532-016-0101-2
Kennedy GJ, Martins JRRA (2014) A parallel finite-element framework for large-scale gradient-based design optimization of high-performance structures. Finite Elem Anal Des 87:56–73. https://doi.org/10.1016/j.finel.2014.04.011
Kennedy GJ, Hicken JE (2015) Improved constraint-aggregation methods. Comput Methods Appl Mech Eng 289:332–354. https://doi.org/10.1016/j.cma.2015.02.017
Kennedy G, Fu Y (2021) Topology optimization benchmark problems for assessing the performance of optimization algorithms. In: AIAA Scitech 2021 forum, AIAA SciTech forum. American Institute of Aeronautics and Astronautics. https://doi.org/10.2514/6.2021-1357
Kennedy G, Fu Y (2022) Topology optimization with natural frequency constraints using a quadratic approximation of a spectral aggregate. In: AIAA SCITECH 2022 forum. AIAA 2022-2244. https://doi.org/10.2514/6.2022-2244
Leader MK, Chin TW, Kennedy GJ (2019) High resolution topology optimization of structures with stress and frequency constraints. AIAA J 57:1–17. https://doi.org/10.2514/1.J057777
Lipp T, Boyd S (2016) Variations and extension of the convex-concave procedure. Optim Eng 17(2):263–287. https://doi.org/10.1007/s11081-015-9294-x
Mittelmann H (2022) Decison tree for optimization software. http://plato.asu.edu/bench.html
Nash SG (1984) Newton-type minimization via the Lanczos method. SIAM J Numer Anal 21(4):770–788. https://doi.org/10.1137/0721052
Nocedal J (1980) Updating quasi-Newton matrices with limited storage. Math Comput 35:773–782. https://doi.org/10.1090/S0025-5718-1980-0572855-7
Nocedal J, Wright SJ (2006) Numerical optimization, 2nd edn. Springer series in operations research and financial engineering. Springer, New York
PACE (2017) Partnership for an Advanced Computing Environment (PACE). http://www.pace.gatech.edu
Rojas-Labanda S, Stolpe M (2015) Benchmarking optimization solvers for structural topology optimization. Struct Multidisc Optim 52(3):527–547. https://doi.org/10.1007/s00158-015-1250-z
Sagliano M (2014) Performance analysis of linear and nonlinear techniques for automatic scaling of discretized control problems. Oper Res Lett 42(3):213–216. https://doi.org/10.1016/j.orl.2014.03.003
Schnabel RB, Koonatz JE, Weiss BE (1985) A modular system of algorithms for unconstrained minimization. ACM Trans Math Softw 11(4):419–440. https://doi.org/10.1145/6187.6192
Sigmund O (2007) Morphology-based black and white filters for topology optimization. Struct Multidisc Optim 33:401–424. https://doi.org/10.1007/s00158-006-0087-x
Sigmund O, Maute K (2013) Topology optimization approaches. Struct Multidisc Optim 48(6):1031–1055. https://doi.org/10.1007/s00158-013-0978-6
Stolpe M, Svanberg K (2001) On the trajectories of penalization methods for topology optimization. Struct Multidisc Optim 21:128–139. https://doi.org/10.1007/s001580050177
Stolpe M, Svanberg K (2001) An alternative interpolation scheme for minimum compliance topology optimization. Struct Multidisc Optim 22:116–124. https://doi.org/10.1007/s001580100129
Svanberg K (1987) The method of moving asymptotes: a new method for structural optimization. Int J Numer Meth Eng 24(2):359–373. https://doi.org/10.1002/nme.1620240207
Wächter A, Biegler LT (2006) On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math Program 106(1):25–57. https://doi.org/10.1007/s10107-004-0559-y
Wendorff A, Botero E, Alonso JJ (2016) Comparing different off-the-shelf optimizers’ performance in conceptual aircraft design. In: 17th AIAA/ISSMO multidisciplinary analysis and optimization conference, AIAA AVIATION forum. American Institute of Aeronautics and Astronautics. https://doi.org/10.2514/6.2016-3362
Wu N, Kenway G, Mader CA, Jasa J, Martins JR (2020) pyOptSparse: a Python framework for large-scale constrained nonlinear optimization of sparse systems. J Open Source Softw 5(54):2564. https://doi.org/10.21105/joss.02564
Xia Y, Chan KW, Liu M (2005) Improved BFGS method for optimal power flow calculation with transient stability constraints. In: IEEE Power engineering society general meeting, vol 1, pp 434–439. https://doi.org/10.1109/PES.2005.1489547
Yuille A, Rangarajan A (2003) The concave-convex procedure. Neural Comput 15(4):915–936. https://doi.org/10.1162/08997660360581958
Zhu C, Byrd RH, Peihuang L, Nocedal J (1997) Algorithm 778: L-BFGS-B: fortran subroutines for large-scale bound-constrained optimization. ACM Trans Math Softw 23(4):550–560. https://doi.org/10.1145/279232.279236
Zillober C (1993) A globally convergent version of the method of moving asymptotes. Struct optim 6(3):166–174. https://doi.org/10.1007/BF01743509
Acknowledgements
This research was supported in part through research cyberinfrastructure resources and services provided by the Partnership for an Advanced Computing Environment (PACE) (PACE 2017) at the Georgia Institute of Technology, Atlanta, Georgia, USA.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Replication of results
The computational software that this work uses is open-source and publicly available on GitHub. The repository names, URLs and commit hashes are listed in Table 3.
Additional information
Responsible Editor: Anton Evgrafov
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Fu, Y., Kennedy, G.J. Quasi-Newton corrections for compliance and natural frequency topology optimization problems. Struct Multidisc Optim 66, 176 (2023). https://doi.org/10.1007/s00158-023-03630-9
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00158-023-03630-9