First-order sequential convex programming using approximate diagonal QP subproblems
Tóm tắt
Optimization algorithms based on convex separable approximations for optimal structural design often use reciprocal-like approximations in a dual setting; CONLIN and the method of moving asymptotes (MMA) are well-known examples of such sequential convex programming (SCP) algorithms. We have previously demonstrated that replacement of these nonlinear (reciprocal) approximations by their own second order Taylor series expansion provides a powerful new algorithmic option within the SCP class of algorithms. This note shows that the quadratic treatment of the original nonlinear approximations also enables the restatement of the SCP as a series of Lagrange-Newton QP subproblems. This results in a diagonal trust-region SQP type of algorithm, in which the second order diagonal terms are estimated from the nonlinear (reciprocal) intervening variables, rather than from historic information using an exact or a quasi-Newton Hessian approach. The QP formulation seems particularly attractive for problems with far more constraints than variables (when pure dual methods are at a disadvantage), or when both the number of design variables and the number of (active) constraints is very large.
Tài liệu tham khảo
Alexandrov AA, Dennis JE, Lewis RM, Torczon V (1998) A trust region framework for managing the use of approximation models in optimization. Struct Multidisc Optim 15:16–23
Barthelemy JFM, Haftka RT (1993) Approximation concepts for optimum structural design - a review. Struct Optim 5:129–144
Borrval T, Petersson J (2001) Large scale topology optimization in 3D using parallel computing. Comput Methods Appl Mech Eng 190:6201–6229
Bruyneel M, Duysinx P, Fleury C (2002) A family of MMA approximations for structural optimization. Struct Multidisc Optim 24:263–276
Conn AR, Gould NIM, Toint PL (2000) Trust-region methods. MPS/SIAM Series on Optimization, SIAM, Philadelphia
Duysinx P, Bruyneel M, Fleury C (2009) Solution of large scale optimization problems with sequential convex programming. Tech. rep., LTAS - Aerospace and Mechanical Engineering, University of Liège
Falk JE (1967) Lagrange multipliers and nonlinear programming. J Math Anal Appl 19:141–159
Fleury C (1979) Structural weight optimization by dual methods of convex programming. Int J Numer Methods Eng 14:1761–1783
Fleury C (1989) Efficient approximation concepts using second order information. Int J Numer Methods Eng 28:2041–2058
Fleury C (1993) Mathematical programming methods for constrained optimization: dual methods. In: Kamat M (ed) Structural optimization: status and promise of progress in astronautics and aeronautics. Progress in Astronautics and Aeronautics, vol 150, AIAA, chap 7, pp 123–150
Fleury C (2009) Structural optimization methods for large scale problems: computational time issues. In: Proc. 8th world congress on structural and multidisciplinary optimization, Lisbon, paper 1184
Fleury C, Braibant V (1986) Structural optimization: a new dual method using mixed variables. Int J Numer Methods Eng 23:409–428
Fleury C, Zhang WH (2000) Selection of appropriate approximation schemes in multi-disciplinary engineering optimization. Adv Eng Softw 31:385–389
Gould N, Orban D, Toint PL (2004) GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. ACM Trans Math Softw 29:353–372
Gould N, Orban D, Toint P (2005) Numerical methods for large-scale nonlinear optimization. Acta Numerica 14:299–361
Groenwold AA, Etman LFP (2008) Sequential approximate optimization using dual subproblems based on incomplete series expansions. Struct Multidisc Optim 36:547–570
Groenwold AA, Etman LFP (2010a) On the conditional acceptance of iterates in SAO algorithms based on convex separable approximations. Struct Multidisc Optim 42:165–178
Groenwold AA, Etman LFP (2010b) A quadratic approximation for structural topology optimization. Int J Numer Methods Eng 82:505–524
Groenwold AA, Etman LFP, Snyman JA, Rooda JE (2007) Incomplete series expansion for function approximation. Struct Multidisc Optim 34:21–40
Groenwold AA, Wood DW, Etman LFP, Tosserams S (2009) A globally convergent optimization algorithm using conservative convex separable diagonal quadratic approximations. AIAA J 47:2649–2657
Groenwold AA, Etman LFP, Wood DW (2010) Approximated approximations in SAO. Struct Multidisc Optim 41:39–56
Haftka RT, Gürdal Z (1991) Elements of structural optimization, 3rd edn. Kluwer Academic Publishers
Kim JR, Choi DH (2008) Enhanced two-point diagonal quadratic approximation methods for design optimization. Comput Methods Appl Mech Eng 197:846–856
Nocedal J, Wright SJ (2006) Numerical optimization, 2nd edn. Series in Operations Research, Springer, Berlin
Schmit L, Farshi B (1974) Some approximation concepts for structural synthesis. AIAA J 12:692–699
Schmit LA, Miura H (1976) Approximation concepts for efficient structural synthesis. Tech. Rep. Report NASA-CR 2552, NASA
Starnes Jr JH, Haftka RT (1979) Preliminary design of composite wings for buckling, stress and displacement constraints. J Aircr 16:564–570
Svanberg K (1987) The method of moving asymptotes - a new method for structural optimization. Int J Numer Methods Eng 24:359–373
Svanberg K (1993) Some second order methods for structural optimization. In: Rozvany G (ed) Optimization of Large Structural Systems, NATA ASI series, vol 231, Kluwer Academic Publishers, pp 567–578
Svanberg K (2002) A class of globally convergent optimization methods based on conservative convex separable approximations. SIAM J Optim 12:555–573
van Keulen F, Haftka RT, Kim NH (2005) Review of options for structural design sensitivity analysis. part 1: linear systems. Comput Methods Appl Mech Engrg 194:3213–3243
Vanderplaats G (1993) Thirty years of modern structural optimization. Adv Eng Softw 16:81–88
Vanderplaats GN (1984) Numerical optimization techniques for engineering design. McGraw-Hill, New York
Vanderplaats GN (2004) Very large scale continuous and discrete variable optimization. In: Proc. 10th AIAA/ISSMO multidisciplinary analysis and optimization conference, Albany, New York, aIAA-2004-4458
Xu S, Grandhi RV (1998) Effective two-point function approximation for design optimization. AIAA J 36:2269–2275
Zhang WH, Fleury C (1997) A modification of convex approximation methods for structural optimization. Comput Struct 64:89–95
Zhu C, Byrd RH, Lu P, Nocedal J (1994) L-bfgs-b: Fortran subroutines for large scale bound constrained optimization. Tech. Rep. Report NAM-11, Northwestern University, EECS Department
Zillober C (1993) A globally convergent version of the method of moving asymptotes. Struct Optim 6:166–174
Zillober C (2001) A combined convex approximation - interior point approach for large scale nonlinear programming. Optim Eng 2:51–73
Zillober C (2002) SCPIP - an efficient software tool for the solution of structural optimization problems. Struct Multidisc Optim 24:362–371
Zillober C, Schittkowski K, Moritzen K (2004) Very large scale optimization by sequential convex programming. Optim Methods Softw 19:103–120