About: A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Je uvedena nová metoda pro účinné řešení třídy konvexních semidefinitních programů. Tato metoda rozšiřuje sekvenční konvexní programování (SCP) na optimalizační problémy s maticovými proměnnými. Základní myšlenkou metody je aproximovat původní optimalizační problém posloupností subproblémů, ve kterých jsou nelineární funkce (v proměnných maticích) aproximovány konvexními blokově separabilními funkcemi. V subproblémech jsou semidefinitní programy s příznivou strukturou, které mohou být účinně vyřešeny stávajícím SDP softwarem. Je ukázáno, že metoda je globálně konvergentní. (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. 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)
Title	A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization (en) Sekvenční algoritmus pro konvexní semidefinití programování aplikovaný na volnou optimalizaci materiálu (cs)
skos:prefLabel	A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization (en) Sekvenční algoritmus pro konvexní semidefinití programování aplikovaný na volnou optimalizaci materiálu (cs)
skos:notation	RIV/67985556:_____/09:00323060!RIV09-AV0-67985556
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(IAA1075402), Z(AV0Z10750506)
http://linked.open...iv/cisloPeriodika	1
http://linked.open...vai/riv/dodaniDat	2009
http://linked.open...aciTvurceVysledku	Kočvara, Michal
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Ústav teorie informace a automatizace AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	301573
http://linked.open...ai/riv/idVysledku	RIV/67985556:_____/09:00323060
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	structural optimization; material optimization; semidefinite programming; sequential convex programming (en)
http://linked.open.../riv/klicoveSlovo	material optimization semidefinite programming structural optimization sequential convex programming
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[B19FACF2A2C1]
http://linked.open...i/riv/nazevZdroje	SIAM Journal on Optimization
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Variational analysis in nonsmooth problems of mathematical physics
http://linked.open...UplatneniVysledku	2009
http://linked.open...v/svazekPeriodika	20
http://linked.open...iv/tvurceVysledku	Kočvara, Michal Stingl, M. Leugering, G.
http://linked.open...n/vavai/riv/zamer	Pokročilé matematické metody získávání, zpracování a využití informací a znalostí ve složitých a nedeterministických systémech
issn	1052-6234
number of pages	26 (xsd:int)

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 110 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software