Abstract
The method of moving asymptotes (MMA) and its globally convergent extension SCP (sequential convex programming) are known to work well in the context of structural optimization. The two main reasons are that the approximation scheme used for the objective function and the constraints fits very well to these applications and that at an iteration point a local optimization model is used such that additional expensive function and gradient evaluations of the original problem are avoided. The subproblems that occur in both methods are special nonlinear convex programs and have traditionally been solved using a dual approach. This is now replaced by an interior point approach. The latter one is more suitable for large problems because sparsity properties of the original problem can be preserved and the separability property of the approximation functions is exploited. The effectiveness of the new method is demonstrated by a few examples dealing with problems of structural optimization.
Similar content being viewed by others
References
C. Fleury, “CONLIN: An efficient dual optimizer based on convex approximation concepts,” Structural Optimization vol. 1, pp. 81–89, 1989.
C. Fleury, “First and second order convex approximation strategies in structural optimization,” Structural Optimization vol. 1, pp. 3–10, 1989.
F. Jarre and M. Saunders, “A practical interior-point method for convex programming,” SIAM J. Optimization vol. 5, pp. 149–171, 1995.
I. J. Lustig, R. E. Marsten, and D. F. Shanno, “On implementing Mehrotra's predictor-corrector interior point method for linear programming,” SIAM J. Optimization vol. 2, no. 3, pp. 435–449, 1992.
S. Mehrotra, “On the implementation of a primal-dual interior point method,” SIAM J. Optimization vol. 2, no. 4, pp. 575–601, 1992.
Y. E. Nesterov and A. S. Nemirovskii, Interior Point Polynomial Methods in Convex Programming, SIAM Publications, 1994.
K. Schittkowski, Ch. Zillober, and R. Zotemantel, “Numerical comparison of nonlinear programming algorithms for structural optimization,” Structural Optimization vol. 7, pp. 1–19, 1994.
K. Svanberg, “The method of moving asymptotes—a new method for structural optimization,” Int. J. Num. Meth. Eng. vol. 24, pp. 359–373, 1987.
K. Svanberg, “A globally convergent version of MMA without linesearch,” in Proceedings of the First World Congress of Structural and Multidisciplinary Optimization, N. \(\dot O\)lhoff and G. I. N Rozvany, eds., Pergamon: Elmsford, NY, 1995, pp. 9–16.
K. Svanberg, “Two primal-dual interior-point methods for theMMAsubproblems,”Technical Report TRITA/MAT-98-OS12, Department of Mathematics, KTH, Stockholm, 1998.
R. J. Vanderbei, Linear Programming: Foundations and Extensions, Kluwer Academic Publishers: Dordrecht, 1996.
F. Vogel and G. Müller, “POPT 1.0 BETA—a new shell optimization add-on module for ANSYS rev. 5.4,” in ANSYS Conference Proceedings, 1998.
S. J. Wright, Primal-Dual Interior-Point Methods, SIAM publications, 1997.
Ch. Zillober, “A globally convergent version of the method of moving asymptotes,” Structural Optimization vol. 6, pp. 459–466, 1993.
Ch. Zillober, “A practical interior point method for a nonlinear programming problem arising in sequential convex programming,” Technical Report TR98-1, Informatik, Universität Bayreuth, WWW: www.unibayreuth. de/departments/math/~czillober/papers/tr98-1.ps, 1998.
Ch. Zillober, “Global convergence of a nonlinear programming method using convex approximations,” Technical Report TR99-1, Informatik, Universität Bayreuth, WWW: www.uni-bayreuth.de/departments/math/ ~czillober/papers/tr99-1.ps, 1999. To appear in Numerical Algorithms.
Ch. Zillober, “Software manual for SCPIP 2.2,” Technical Report TR01-2, Informatik, Universität Bayreuth, WWW: www.uni-bayreuth.de/departments/math/~czillober/papers/tr01-2.ps, 2001.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zillober, C. A Combined Convex Approximation—Interior Point Approach for Large Scale Nonlinear Programming. Optimization and Engineering 2, 51–73 (2001). https://doi.org/10.1023/A:1011822920332
Issue Date:
DOI: https://doi.org/10.1023/A:1011822920332