Mathematical Programming Methods for Constrained Optimization: Dual Methods

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

[2]  Claude Fleury.  Reconciliation of Mathematical Programming and Optimality Criteria Approaches to Structural Optimization , 1982 .

[3]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[4]  C. Fleury.  Structural weight optimization by dual methods of convex programming , 1979 .

[5]  V. Braibant,et al.  An approximation-concepts approach to shape optimal design , 1985 .

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

[7]  Raphael T. Haftka,et al.  Preliminary design of composite wings for buckling, strength and displacement constraints , 1979 .

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

[9]  Lucien A. Schmit,et al.  Advances in dual algorithms and convex approximation methods , 1988 .

[10]  L. Schmit,et al.  Approximation concepts for efficient structural synthesis , 1976 .

[11]  C. Fleury,et al.  Dual methods and approximation concepts in structural synthesis , 1980 .

[12]  F. A. Lootsma,et al.  A comparative study of primal and dual approaches for solving separable and partially-separable nonlinear optimization problems , 1989 .

[13]  Claude Fleury.  Shape Optimal Design by the Convex Linearization Method , 1986 .

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