Sequential convex programming in theory and praxis

Please always quote using this URN: urn:nbn:de:bvb:20-opus-35513
  • In this paper, convex approximation methods, suclt as CONLIN, the method of moving asymptotes (MMA) and a stabilized version of MMA (Sequential Convex Programming), are discussed with respect to their convergence behaviour. In an extensive numerical study they are :finally compared with other well-known optimization methods at 72 examples of sizing problems.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics
Author: Christian Zillober
Document Type:Conference Proceeding
Faculties:Fakultät für Mathematik und Informatik / Institut für Mathematik
Year of Completion:1993
Source:In: Structural Optimization 93: The World Congress on Optimal Design of Structural Systems, Rio de Janeiro, 2.-6. August 1993 / J. Herskovits. - 79-86.
Dewey Decimal Classification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Release Date:2009/08/19