Abstract
The method of moving asymptotes (MMA), which is an approach of successive convex approximations, is known to work well for structural optimization problems. The lack of a missing global convergence proof has been closed by the method SCP (sequential convex programming) by adding a line search with respect to the augmented Lagrangian function. The convergence properties will be presented. Traditionally, the subproblems of both versions are solved using a dual approach. In the final stage, many linear systems of the dimension M × M, where M is the number of constraints, have to be solved. These linear systems are dense independent of the structure of the problem. This limits the methods to at most medium sized problems. Now, an interior point approach for the solution of the subproblems is used. The main advantage is, that sparsity properties of the original problem can be preserved for the subproblems, which makes the approach attractive for large scale problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fleury, C. (1989): CONLIN: An efficient dual optimizer based on convex approximation concepts. Structural Optimization, 1, 81–89.
Svanberg, K. (1987): The Method of Moving Asymptotes — a new method for Structural Optimization. Int. J. Num. Meth. Eng., 24, 359–373.
Svanberg, K. (1995): A globally convergent version of MMA without linesearch. In: N. Olhoff, G. Rozvany (eds.), Proceedings of the First World Congress of Structural and Multidisciplinary Optimization, 9–16. Pergamon.
Vanderbei, R. (1996): Linear Programming: Foundations and Extensions. Kluwer Academic Publishers.
Wright, S. (1997): Primal-Dual Interior-Point Methods. SIAM publications.
Zillober, C. (1993): A globally convergent version of the Method of Moving Asymptotes. Structural Optimization, 6, 459–466.
Zillober, C. (1999): Global convergence of a Nonlinear Programming method using convex approximations. Tech. Rep. TR99-1, Informatik, Universität Bayreuth, http://www.uni-bayreuth.de/departments/math/~czillober/papers/tr99-1.ps.
Zillober, C. (2000): A combined convex approximation — interior point approach for large scale nonlinear programming. Tech. Rep. TR00–1, Informatik, Universität Bayreuth, http://www.uni-bayreuth.de/departments/math/~czillober/papers/tr00-1.ps.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zillober, C. (2001). Convex Approximation Methods for Practical Optimization. In: Fleischmann, B., Lasch, R., Derigs, U., Domschke, W., Rieder, U. (eds) Operations Research Proceedings. Operations Research Proceedings, vol 2000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56656-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-56656-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41587-9
Online ISBN: 978-3-642-56656-1
eBook Packages: Springer Book Archive