Performance of some SQP algorithms on structural design problems. (English) Zbl 0599.73090

This paper describes the basic ideas of sequential quadratic programming (SQP) algorithms for design optimization. There are two fundamental differences between the various algorithms: (i) the definition of the QP subproblem solved at each iteration, and (ii) the descent function used during step size determination. The performances of the algorithms can change dramatically depending on how the two steps are executed. Numerical implementation details of various computational steps are discussed.
Three programs based on SQP algorithms are used to solve 17 structural design problems having 7 to 96 design variables and 10 to 1051 performance constraints besides design variable bounds. Based on the performance of these programs, efficient procedures to execute various steps of the SQP methods are determined. It is concluded that the potential constraint strategy, where only a subset of the constraints is used to define the QP subproblem, is essential for large scale engineering design applications. With this strategy the SQP methods are quite robust and have great potential for routine application in engineering design.


74P99 Optimization problems in solid mechanics
74S30 Other numerical methods in solid mechanics (MSC2010)
65K05 Numerical mathematical programming methods
74-04 Software, source code, etc. for problems pertaining to mechanics of deformable solids


Full Text: DOI


[1] Schmit, AIAA Journal 19 pp 1249– (1981)
[2] Vanderplaats, AIAA J. 20 pp 992– (1982)
[3] and , ’Optimal design of trusses with the program IDESIGN’, Technical Report No. ODL 85.6, Optimal Design Laboratory, College of Engineering. The University of Iowa, Iowa City, IA, 1985.
[4] Arora, Computational Mechanics–An International Journal (1986)
[5] Introduction to Linear and Nonlinear Programming, Addison-Wesley Publishing Co., Reading Massachusetts, 1984.
[6] ’A fast algorithm for nonlinearly constrained optimization calculations’, Lecture Notes in Mathematics, 630, Springer-Verlag, Berlin, Heidelberg, New York, 1978 pp. 144-157.
[7] ’VMCWD: a Fortran subroutine for constrained optimization’, Technical Report DAMTP 1982/N A4, University of Cambridge, 1982.
[8] K, Math. Operations Forsch. U. Statist. 14 pp 197– (1983)
[9] , and , ’User’s guide for NPSOL (version 2.1): a FORTRAN package for nonlinear programming’, Technical Report SOL 84-7, Department of Operations Reasearch, Standard University, California, 1984.
[10] , and , ’Solution of the general nonlinear programming problem with subroutine VMCON’, ANL-80-64, Argonne National Laboratory, Argonne, Illinois, 1980.
[11] Theoretical Manual for I DESIGN, Technical Report No. ODL-85.9, Optimal Design Laboratory, College of Engineering, University of Iowa, Iowa City, IA, 1985.
[12] ’Algorithms for the general problem of mathematical programming’, Kibernetica, No. 5, 120-125 (1970) (In Russian–translated in Cybernetics, May 1973). · Zbl 0234.90060
[13] Lim, Computer Methods in Applied Mechanics and Engineering (1986)
[14] ’NLPQL: A Fortran subroutine solving constrained nonlinear programming problems’, Working Paper, University of Stuttgart, 1984.
[15] and , ’Test examples for nonlinear programming codes’, Lecture Notes in Economics and Mathematical Systemsm, Vol. 187, Springer-Verlag, New York, 1981. · Zbl 0452.90038
[16] , , and , ’Performance of several optimization algorithms on a set of nonlinear programming test problems’, Technical Report No. ODL 85.19, Optimal Design Laboratory, College of Engineering, University of Iowa, Iowa City, IA, 1985.
[17] ’Variable metric methods for minimization’, Atomic Energy Commission Reserch and Development Report, ANL-5990 (Rev.), 1959.
[18] Dennis, SIAM Review 19 pp 46– (1977)
[19] ’Numerical Optimization Techniques for Engineering Design’, McGraw Hill, New York, 1984.
[20] and , ’Elements of Structural Optimization’, Martinus Nijhoff Publishers, The Netherlands.
[21] and , Engineering Optimization, Wiley Interscience, New York, 1983.
[22] and , Practical Optimization, Academic Press, London and New York, 1981. · Zbl 0503.90062
[23] and , ’A study of constrained variable metric methods for structural optimization’, Technical Report No. CAD-SS-84.3, The Optimal Design Laboratory, College of Engineering, The University of Iowa, Iowa City, IA, 1984.
[24] Biggs, J. Inst. Math. Appl. 21 pp 67– (1978)
[25] ’An algorithm for optimum structural design without line search’, in , , and (eds), New Directions in Optimum Structural Design, John Wiley, New York, 1984, Chapter 20.
[26] , and , ’User’s guide for QPSOL (version 3.2): a FORTRAN package for quadratic programming’, Technical Report SOL 84-6, Department of Operations Research, Stanford University, California, 1984.
[27] ’Exact penalty function algorithms for finite dimensional and control optimization problems’, Ph.D. Thesis, Imperial College, London, 1978.
[28] , and , ’Model building and practical implementation aspects in nonlinear programming’, in (ed.), Computational Mathematical Programming, Proceedings of the NATO ASI, Bad Windsheim, Germany, 23 July-2 August Springer-Verlag. New York, 1984, pp. 209-248.
[29] and , Applied Optimal Design: Mechnical and Structural Systems, Wiley-Interscience, New York, 1979.
[30] ’On improving efficiency of an algorithm for structural optimization and a user’s manual for program Trussopt3’, Technical Report No. 12, Materials Engg. Division, The University of Iowa, Iowa City, AI, 1976.
[31] Chen, AIAA J. 10 pp 155– (1972)
[32] Arora, AIAA J. 17 pp 970– (1979)
[33] and , ’Performance of some superlinearly convergent RQP optimization algorithms on structural design problems’, Technical Report No. ODL-85.12, Optimal Design Laboratory, College of Engineering, University of Iowa, Iowa City, IA, 1985.
[34] Belegundu, Int. j. numer. methods eng. 21 pp 1583– (1985)
[35] Vanderplaats, Engineering Computations 2 pp 96– (1985)
[36] Harwell Subroutine Library, Computer Sciences and Systmes Division, Building 89, A.E.R.E., Harwell Didcot, Oxon, England, 1976.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.