Number of the records: 1
A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization
- 1.
SYSNO ASEP 0323060 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Ostatní články Title A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization Title Sekvenční algoritmus pro konvexní semidefinití programování aplikovaný na volnou optimalizaci materiálu Author(s) Stingl, M. (DE)
Kočvara, Michal (UTIA-B) RID, ORCID
Leugering, G. (DE)Source Title SIAM Journal on Optimization. - : SIAM Society for Industrial and Applied Mathematics - ISSN 1052-6234
Roč. 20, č. 1 (2009), s. 130-155Number of pages 26 s. Language eng - English Country US - United States Keywords structural optimization ; material optimization ; semidefinite programming ; sequential convex programming Subject RIV BA - General Mathematics R&D Projects IAA1075402 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) CEZ AV0Z10750506 - UTIA-B (2005-2011) DOI 10.1137/070711281 Annotation A new method for the efficient solution of a class of convex semidefinite programming problems is introduced. The method extends the sequential convex programming (SCP) concept to optimization problems with matrix variables. The basic idea of the new method is to approximate the original optimization problem by a sequence of subproblems, in which nonlinear functions (defined in matrix variables) are approximated by block separable convex functions. The subproblems are semidefinite programs with a favorable structure which can be efficiently solved by existing SDP software. The new method is shown to be globally convergent. The article is concluded by a series of numerical experiments with free material optimization problems demonstrating the effectiveness of the generalized SCP approach. Workplace Institute of Information Theory and Automation Contact Markéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201. Year of Publishing 2009
Number of the records: 1