메뉴 건너뛰기




Volumn 42, Issue 2, 2010, Pages 165-178

On the conditional acceptance of iterates in SAO algorithms based on convex separable approximations

Author keywords

Conservatism; Diagonal quadratic approximation; Filtered conservatism; Sequential approximate optimization (SAO); Sequential convex programming (SCP); Trust region method

Indexed keywords

CONSERVATISM; CONVEX PROGRAMMING; FILTERED CONSERVATISM; QUADRATIC APPROXIMATION; SEQUENTIAL APPROXIMATE OPTIMIZATION; TRUST-REGION METHODS;

EID: 77956618394     PISSN: 1615147X     EISSN: 16151488     Source Type: Journal    
DOI: 10.1007/s00158-010-0498-6     Document Type: Article
Times cited : (15)

References (40)
  • 1
    • 0031998787 scopus 로고    scopus 로고
    • A trust region framework for managing the use of approximation models in optimization
    • Alexandrov NM, Dennis JE, Lewis RM, Torczon V (1998) A trust region framework for managing the use of approximation models in optimization. Struct Optim 15:16-23
    • (1998) Struct Optim , vol.15 , pp. 16-23
    • Alexandrov, N.M.1    Dennis, J.E.2    Lewis, R.M.3    Torczon, V.4
  • 2
    • 34250083818 scopus 로고
    • Approximation concepts for optimum structural design-a review
    • Barthelemy JFM, Haftka RT (1993) Approximation concepts for optimum structural design-a review. Struct Optim 5:129-144
    • (1993) Struct Optim , vol.5 , pp. 129-144
    • Jfm, B.1    Haftka, R.T.2
  • 3
    • 0035860268 scopus 로고    scopus 로고
    • Large scale topology optimization in 3D using parallel computing
    • Borrvall T, Petersson J (2001) Large scale topology optimization in 3D using parallel computing. Comput Methods Appl Mech Eng 190:6201-6229
    • (2001) Comput Methods Appl Mech Eng , vol.190 , pp. 6201-6229
    • Borrvall, T.1    Petersson, J.2
  • 4
    • 0036810519 scopus 로고    scopus 로고
    • A family of MMA approximations for structural optimization
    • Bruyneel M, Duysinx P, Fleury C (2002) A family of MMA approximations for structural optimization. Struct Multidisc Optim 24:263-276
    • (2002) Struct Multidisc Optim , vol.24 , pp. 263-276
    • Bruyneel, M.1    Duysinx, P.2    Fleury, C.3
  • 9
    • 0041611188 scopus 로고
    • Lagrange multipliers and nonlinear programming
    • Falk JE (1967) Lagrange multipliers and nonlinear programming. J Math Anal Appl 19:141-159
    • (1967) J Math Anal Appl , vol.19 , pp. 141-159
    • Falk, J.E.1
  • 10
    • 0013468012 scopus 로고    scopus 로고
    • User manual for filter SQP
    • Department of Mathematics, University of Dundee, Dundee
    • Fletcher R, Leyffer S (1998) User manual for filter SQP. Numerical Analysis Report NA\181. Department of Mathematics, University of Dundee, Dundee
    • (1998) Numerical Analysis Report NA\181
    • Fletcher, R.1    Leyffer, S.2
  • 11
    • 0001556338 scopus 로고    scopus 로고
    • Nonlinear programming without a penalty function
    • Fletcher R, Leyffer S (2002) Nonlinear programming without a penalty function. Math Program 91:239-269
    • (2002) Math Program , vol.91 , pp. 239-269
    • Fletcher, R.1    Leyffer, S.2
  • 15
    • 0013468012 scopus 로고    scopus 로고
    • On the global convergence of a filter-SQP algorithm
    • Department of Mathematics, University of Dundee, Dundee
    • Fletcher R, Leyffer S, Toint P (2005) On the global convergence of a filter-SQP algorithm. Numerical analysis report NA\197, Department of Mathematics, University of Dundee, Dundee
    • (2005) Numerical Analysis Report NA\197
    • Fletcher, R.1    Leyffer, S.2    Toint, P.3
  • 16
    • 0018766811 scopus 로고
    • Structural weight optimization by dual methods of convex programming
    • Fleury C (1979) Structural weight optimization by dual methods of convex programming. Int J Numer Methods Eng 14:1761-1783
    • (1979) Int J Numer Methods Eng , vol.14 , pp. 1761-1783
    • Fleury, C.1
  • 18
    • 0022676236 scopus 로고
    • Structural optimization: A new dual method using mixed variables
    • Fleury C, Braibant V (1986) Structural optimization: a new dual method using mixed variables. Int J Numer Methods Eng 23:409-428
    • (1986) Int J Numer Methods Eng , vol.23 , pp. 409-428
    • Fleury, C.1    Braibant, V.2
  • 19
    • 38349102213 scopus 로고    scopus 로고
    • Groenwold AA, Etman LFP (2008a) On the equivalence of optimality criterion methods and sequential approximate optimization in the classical topology layout problem. Int J Numer Methods Eng 73:297-316
    • (2008) Int J Numer Methods Eng , vol.73 , pp. 297-316
    • Groenwold, A.A.1    Lfp, E.2
  • 20
    • 54949144664 scopus 로고    scopus 로고
    • Sequential approximate optimization using dual subproblems based on incomplete series expansions
    • Groenwold AA, Etman LFP (2008b) Sequential approximate optimization using dual subproblems based on incomplete series expansions. Struct Multidisc Optim 36:547-570
    • (2008) Struct Multidisc Optim , vol.36 , pp. 547-570
    • Groenwold, A.A.1    Lfp, E.2
  • 23
    • 72149122405 scopus 로고    scopus 로고
    • Globally convergent optimization algorithm using conservative convex separable diagonal quadratic approximations
    • Groenwold AA, Wood DW, Etman LFP, Tosserams S (2009) Globally convergent optimization algorithm using conservative convex separable diagonal quadratic approximations. AIAA J 47:2649-2657
    • (2009) AIAA J , vol.47 , pp. 2649-2657
    • Groenwold, A.A.1    Wood, D.W.2    Lfp, E.3    Tosserams, S.4
  • 26
  • 29
    • 0001908512 scopus 로고
    • On methods for discrete structural optimization
    • Ringertz UT (1988) On methods for discrete structural optimization. Eng Optim 13:47-64
    • (1988) Eng Optim , vol.13 , pp. 47-64
    • Ringertz, U.T.1
  • 30
    • 0036904463 scopus 로고    scopus 로고
    • The dynamic-Q optimization method: An alternative to SQP? Comput methods
    • Snyman JA, Hay AM (2002) The Dynamic-Q optimization method: an alternative to SQP? Comput Methods Appl 44:1589-1598
    • (2002) Appl , vol.44 , pp. 1589-1598
    • Snyman, J.A.1    Hay, A.M.2
  • 31
    • 0023287947 scopus 로고
    • The method of moving asymptotes-a new method for structural optimization
    • Svanberg K (1987) The method of moving asymptotes-a new method for structural optimization. Int J Numer Methods Eng 24:359-373
    • (1987) Int J Numer Methods Eng , vol.24 , pp. 359-373
    • Svanberg, K.1
  • 33
    • 0036013025 scopus 로고    scopus 로고
    • A class of globally convergent optimization methods based on conservative convex separable approximations
    • Svanberg K (2002) A class of globally convergent optimization methods based on conservative convex separable approximations. SIAM J Optim 12:555-573
    • (2002) SIAM J Optim , vol.12 , pp. 555-573
    • Svanberg, K.1
  • 36
    • 70450204415 scopus 로고    scopus 로고
    • Non-convex dual forms based on exponential intervening variables, with application to weight minimization
    • Wood DW, Groenwold AA (2009) Non-convex dual forms based on exponential intervening variables, with application to weight minimization. Int J Numer Methods Eng 80:1544-1572
    • (2009) Int J Numer Methods Eng , vol.80 , pp. 1544-1572
    • Wood, D.W.1    Groenwold, A.A.2
  • 37
    • 77956618838 scopus 로고    scopus 로고
    • A bounded dual to circumvent the requirement of relaxation in SAO
    • (submitted) (OPTE-S-09-00053)
    • Wood DW, Groenwold AA, Etman LFP (2009) A bounded dual to circumvent the requirement of relaxation in SAO. Optim Eng (submitted) (OPTE-S-09-00053)
    • (2009) Optim Eng
    • Wood, D.W.1    Groenwold, A.A.2    Lfp, E.3
  • 38
    • 0001444320 scopus 로고
    • A globally convergent version of the method of moving asymptotes
    • Zillober C (1993) A globally convergent version of the method of moving asymptotes. Struct Multidisc Optim 6:166-174
    • (1993) Struct Multidisc Optim , vol.6 , pp. 166-174
    • Zillober, C.1
  • 39
    • 0012146383 scopus 로고    scopus 로고
    • A combined convex approximation-interior point approach for large scale nonlinear programming
    • Zillober C (2001) A combined convex approximation-interior point approach for large scale nonlinear programming. Optim Eng 2:51-73
    • (2001) Optim Eng , vol.2 , pp. 51-73
    • Zillober, C.1
  • 40
    • 1542285801 scopus 로고    scopus 로고
    • Very large scale optimization by sequential convex programming
    • Zillober C, Schittkowski K, Moritzen K (2004) Very large scale optimization by sequential convex programming. Optim Methods Softw 19:103-120
    • (2004) Optim Methods Softw , vol.19 , pp. 103-120
    • Zillober, C.1    Schittkowski, K.2    Moritzen, K.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.