Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Christian Zillober"'
Publikováno v:
Optimization Methods and Software. 19:103-120
We introduce a method for constrained nonlinear programming that is widely used in mechanical engineering and that is known under the name SCP for sequential convex programming. The algorithm consists of solving a sequence of convex and separable sub
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ad0c8b8a1e533d54100cf3c949fee87
https://doi.org/10.1080/10556780410001647195
https://doi.org/10.1080/10556780410001647195
Autor:
Christian Zillober
Publikováno v:
Structural and Multidisciplinary Optimization. 24:362-371
This paper describes SCPIP, a FORTRAN77 subroutine that has been proven to be a reliable implementation of convex programming methods in an industrial environment. Convex approximation methods like the method of moving asymptotes are used nowadays in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aec9502d0202424a0f603799c915e749
https://doi.org/10.1007/s00158-002-0248-5
https://doi.org/10.1007/s00158-002-0248-5
Autor:
Christian Zillober
Publikováno v:
Optimization and Engineering. 2:51-73
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 obje
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c39d64243f30f8a233422e27700b5d18
https://doi.org/10.1023/a:1011822920332
https://doi.org/10.1023/a:1011822920332
Autor:
Christian Zillober
Publikováno v:
Numerical Algorithms. 27:265-289
The method of moving asymptotes (MMA) and its globally convergent extension SCP (sequential convex programming) are known to work well for certain problems arising in structural optimization. In this paper, the methods are extended for a general math
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b709e30c8f85b18a30cceeae8bb5ff1a
https://doi.org/10.1023/a:1011841821203
https://doi.org/10.1023/a:1011841821203
Autor:
Christian Zillober
Publikováno v:
Structural Optimization. 6:166-174
The method of moving asymptotes (MMA) which is known to work excellently for solving structural optimization problems has one main disadvantage: convergence cannot be guaranteed and in practical use this fact sometimes leads to unsatisfactory results
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bd49d101037d69b110f01c8f59c33ec
https://doi.org/10.1007/bf01743509
https://doi.org/10.1007/bf01743509
Autor:
Klaus Schittkowski, Christian Zillober
Publikováno v:
Applied Optimization ISBN: 0387242546
We introduce two classes of methods for constrained smooth nonlinear programming that are widely used in practice and that are known under the names SQP for sequential quadratic programming and SCP for sequential convex programming. In both cases, co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73af4fc8849ba6e252cce94fd1663872
https://doi.org/10.1007/0-387-24255-4_14
https://doi.org/10.1007/0-387-24255-4_14
Autor:
Klaus Schittkowski, Christian Zillober
Publikováno v:
IFIP International Federation for Information Processing ISBN: 9781402077609
System Modelling and Optimization
System Modelling and Optimization
We introduce some methods for constrained nonlinear programming that are widely used in practice and that are known under the names SQP for sequential quadratic programming and SCP for sequential convex programming. In both cases, convex subproblems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a71290081fdb1fcbd78a2819e235d5c8
https://doi.org/10.1007/0-387-23467-5_5
https://doi.org/10.1007/0-387-23467-5_5
Autor:
Klaus Schittkowski, Christian Zillober
Publikováno v:
Lecture Notes in Economics and Mathematical Systems ISBN: 9783540589969
Sequential convex programming methods became very popular in the past for special domains of application, e.g. the optimal structural design in mechanical engineering. The algorithm uses an inverse approximation of certain variables so that a convex,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74532a687b552910402b99e2e74f7645
https://doi.org/10.1007/978-3-642-88272-2_8
https://doi.org/10.1007/978-3-642-88272-2_8
For FE-based structural optimization systems, a large variety of different numerical algorithms is available, e.g. sequential linear programming, sequential quadratic programming, convex approximation, generalized reduced gradient, multiplier, penalt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c583029dc5c79364d81ac0f1932ecf8d
https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/2631
https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/2631
SUMMARY In distance geometry problems and many other applications, we are faced with the optimization of high-dimensional quadratic functions subject to linear equality constraints. A new approach is presented that projects the constraints, preservin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8fa7ec667a17fdbbbdce9c07acf81f89
https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/2632
https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/2632