Sequential Convex Programming Methods

Sequential convex programming methods became very popular in the past for special domains of application, e.g. the optimal structural design in mechanical engineering. The algorithm uses an inverse approximation of certain variables so that a convex, separable nonlinear programming problem must be solved in each iteration. In this paper the method is outlined and it is shown, how the iteration process can be stabilized by a line search. The convergence results are presented for a special variant called method of moving asymptotes. The algorithm was implemented in FORTRAN and the numerical performance is evaluated by a comparative study, where the test problems are formulated through a finite element analysis.

[1]  Christian Zillober.  A globally convergent version of the method of moving asymptotes , 1993 .

[2]  George I. N. Rozvany,et al.  optimization of large structural systems , 1990 .

[3]  K. Svanberg.  The method of moving asymptotes—a new method for structural optimization , 1987 .

[4]  Rainer Zotemantel,et al.  MBB– Lagrange : a computer aided structural design system , 1993 .

[5]  K. Schittkowski.  Solving nonlinear programming problems with very many constraints , 1992 .

[6]  Claude Fleury,et al.  CONLIN: An efficient dual optimizer based on convex approximation concepts , 1989 .

[7]  Klaus Schittkowski,et al.  Software systems for structural optimization , 1993 .

[8]  V. Braibant,et al.  Structural optimization: A new dual method using mixed variables , 1986 .

[9]  M. J. D. Powell,et al.  A fast algorithm for nonlinearly constrained optimization calculations , 1978 .

[10]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

[11]  K. Schittkowski,et al.  Numerical comparison of nonlinear programming algorithms for structural optimization , 1994 .

[12]  K. Schittkowski.  The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function , 1982 .

[13]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[14]  Christian Zillober.  Eine global konvergente Methode zur Lösung von Problemen aus der Strukturoptimierung , 1992 .

[15]  J. Strodiot,et al.  A MATHEMATICAL CONVERGENCE ANALYSIS OF THE CONVEX LINEARIZATION METHOD FOR ENGINEERING DESIGN OPTIMIZATION , 1987 .

[16]  M. Powell.  On the quadratic programming algorithm of Goldfarb and Idnani , 1985 .

[17]  K. Schittkowski.  On the Convergence of a Sequential Quadratic Programming Method with an Augmented Lagrangian Line Search Functions. , 1982 .

[18]  K. Svanberg,et al.  The Method of Moving Asymptotes (MMA) with Some Extensions , 1993 .

[19]  K. Schittkowski.  The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function , 1982 .

[20]  Klaus Schittkowski,et al.  NLPQL: A fortran subroutine solving constrained nonlinear programming problems , 1986 .