Skip to main content
Log in

A generalized method of moving asymptotes (GMMA) including equality constraints

  • Research Papers
  • Published:
Structural optimization Aims and scope Submit manuscript

Abstract

A convex programming optimizer called GMMA (Generalized Method of Moving Asymptotes) is presented in this paper. This method aims at solving engineering design problems including nonlinear equality and inequality constraints. The basic feature of this optimizer is that the efficient dual solution strategy together with the flexible GMMA approximation scheme are used. Especially, nonlinear equality constraints can be exactly satisfied by the intermediate solution of each explicit subproblem because their linearization is updated in an internal loop of the subproblem. This method will be illustrated by a hydrodynamic design application.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Abadie, J.; Carpentier, J. 1969: Generalization of the Wolfe reduced gradient method to the case of nonlinear constraints. In: Fletcher, R. (ed.)Optimization, pp. 37–47. New York: Academic Press

    Google Scholar 

  • Bletzinger, K.-U. 1993: Explicit approximation of equality constraints.Struct. Optim. 5, 175–183

    Google Scholar 

  • Bochenek, B.; Rasmussen, J. 1992: On the implementation of equality constraints into the method of moving asymptotes. In: Hirsch, C. et al. (eds.)Numerical methods in engineering 92, pp. 811–818. Amsterdam: Elsevier

    Google Scholar 

  • Fleury, C.; Braibant, V. 1986: Structural optimization — a new dual method using mixed variables.Int. J. Num. Meth. Engrg. 24, 359–373

    Google Scholar 

  • Maisonneuve, J.J. 1992: Optimization de formes de carènes.Rapport final de synthèse SIREHNA 90/32/RF, Nantes, France

  • Schittkowski, K. 1985/86: NLPQL: A fortran subroutine solving constrained nonlinear programming problems.Annals of Operations Research, 485–500

  • Schmit, L.A.; Farshi, B. 1974: Some approximation concepts for structural synthesis.AIAA J. 12, 692–699

    Google Scholar 

  • Svanberg, K. 1987: Method of moving asymptotes — a new method for structural optimization.Int. J. Num. Meth. Engrg. 24, 359–373

    Google Scholar 

  • Svanberg, K. 1993: The method of moving asymptotes (MMA) with some extensions. In: Rozvany, G. (ed.)Optimization of large structural systems, pp. 555–566 (Proc. NATO ASI, held in Berchtesgaden, Germany, 1991). Dordrecht: Kluwer

    Google Scholar 

  • Zhang, W.H. 1991:Sensitivity analysis and structural shape optimization by finite element method. Ph.D Thesis, University of Liège, Belgium

    Google Scholar 

  • Zhang, W.H.; Fleury, C. 1994: Recent advances in convex approximation methods for structural optimisation. In: Topping, B.H.V.; Papadrakakis, M. (eds.)Advances in structural optimization, pp. 83–90. Edinburgh: Civil-Comp Press

    Google Scholar 

  • Zhang, W.H.; Fleury, C. 1995: Structural shape optimization and convex programming methods.Lecture at Int. Symp. on Optimization of Mechanical Systems (IUTAM) (held in Stuttgart, Germany)

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, W.H., Fleury, C., Duysinx, P. et al. A generalized method of moving asymptotes (GMMA) including equality constraints. Structural Optimization 12, 143–146 (1996). https://doi.org/10.1007/BF01196948

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01196948

Keywords

Navigation