Sequential convex programming in theory and praxis
Abstract
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 problemsSimilar works
Full text
Last time updated on 17/05/2016
This paper was published in Online-Publikations-Server der Universität Würzburg.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.