. "A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization"@en . . . "Leugering, G." . . "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."@en . . "Sekven\u010Dn\u00ED algoritmus pro konvexn\u00ED semidefinit\u00ED programov\u00E1n\u00ED aplikovan\u00FD na volnou optimalizaci materi\u00E1lu"@cs . "Je uvedena nov\u00E1 metoda pro \u00FA\u010Dinn\u00E9 \u0159e\u0161en\u00ED t\u0159\u00EDdy konvexn\u00EDch semidefinitn\u00EDch program\u016F. Tato metoda roz\u0161i\u0159uje sekven\u010Dn\u00ED konvexn\u00ED programov\u00E1n\u00ED (SCP) na optimaliza\u010Dn\u00ED probl\u00E9my s maticov\u00FDmi prom\u011Bnn\u00FDmi. Z\u00E1kladn\u00ED my\u0161lenkou metody je aproximovat p\u016Fvodn\u00ED optimaliza\u010Dn\u00ED probl\u00E9m posloupnost\u00ED subprobl\u00E9m\u016F, ve kter\u00FDch jsou neline\u00E1rn\u00ED funkce (v prom\u011Bnn\u00FDch matic\u00EDch) aproximov\u00E1ny konvexn\u00EDmi blokov\u011B separabiln\u00EDmi funkcemi. V subprobl\u00E9mech jsou semidefinitn\u00ED programy s p\u0159\u00EDznivou strukturou, kter\u00E9 mohou b\u00FDt \u00FA\u010Dinn\u011B vy\u0159e\u0161eny st\u00E1vaj\u00EDc\u00EDm SDP softwarem. Je uk\u00E1z\u00E1no, \u017Ee metoda je glob\u00E1ln\u011B konvergentn\u00ED."@cs . "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." . . . "P(IAA1075402), Z(AV0Z10750506)" . "A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization" . "RIV/67985556:_____/09:00323060!RIV09-AV0-67985556" . "Stingl, M." . . "SIAM Journal on Optimization" . "[B19FACF2A2C1]" . . . . "Sekven\u010Dn\u00ED algoritmus pro konvexn\u00ED semidefinit\u00ED programov\u00E1n\u00ED aplikovan\u00FD na volnou optimalizaci materi\u00E1lu"@cs . "RIV/67985556:_____/09:00323060" . "26"^^ . "US - Spojen\u00E9 st\u00E1ty americk\u00E9" . . "3"^^ . "A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization"@en . "A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization" . . . "structural optimization; material optimization; semidefinite programming; sequential convex programming"@en . . "1"^^ . . "20" . "1052-6234" . "Ko\u010Dvara, Michal" . . "301573" . "1" . .