ON OPTIMUM DESIGN OF FRAME STRUCTURES

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21110%2F20%3A00342259" target="_blank" >RIV/68407700:21110/20:00342259 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21230/20:00342259

Výsledek na webu

<a href="http://dx.doi.org/10.14311/APP.2020.26.0117" target="_blank" >http://dx.doi.org/10.14311/APP.2020.26.0117</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.14311/APP.2020.26.0117" target="_blank" >10.14311/APP.2020.26.0117</a>

Jazyk výsledku

angličtina

Název v původním jazyce

ON OPTIMUM DESIGN OF FRAME STRUCTURES

Popis výsledku v původním jazyce

Optimization of frame structures is formulated as a non-convex optimization problem, which is currently solved to local optimality. In this contribution, we investigate four optimization approaches: (i) general non-linear optimization, (ii) optimality criteria method, (iii) non-linear semidefinite programming, and (iv) polynomial optimization. We show that polynomial optimization solves the frame structure optimization to global optimality by building the (moment-sums-of-squares) hierarchy of convex linear semidefinite programming problems, and it also provides guaranteed lower and upper bounds on optimal design. Finally, we solve three sample optimization problems and conclude that the local optimization approaches may indeed converge to local optima, without any solution quality measure, or even to infeasible points. These issues are readily overcome by using polynomial optimization, which exhibits a finite convergence, at the prize of higher computational demands.

Název v anglickém jazyce

ON OPTIMUM DESIGN OF FRAME STRUCTURES

Popis výsledku anglicky

Optimization of frame structures is formulated as a non-convex optimization problem, which is currently solved to local optimality. In this contribution, we investigate four optimization approaches: (i) general non-linear optimization, (ii) optimality criteria method, (iii) non-linear semidefinite programming, and (iv) polynomial optimization. We show that polynomial optimization solves the frame structure optimization to global optimality by building the (moment-sums-of-squares) hierarchy of convex linear semidefinite programming problems, and it also provides guaranteed lower and upper bounds on optimal design. Finally, we solve three sample optimization problems and conclude that the local optimization approaches may indeed converge to local optima, without any solution quality measure, or even to infeasible points. These issues are readily overcome by using polynomial optimization, which exhibits a finite convergence, at the prize of higher computational demands.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

<a href="/cs/project/EF16_019%2F0000778" target="_blank" >EF16_019/0000778: Centrum pokročilých aplikovaných přírodních věd</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

NMM 2019 Nano & Macro Mechanics

ISBN

978-80-01-06720-8

ISSN

—

e-ISSN

2336-5382

Počet stran výsledku

9

Strana od-do

117-125

Název nakladatele

Czech Technical University in Prague

Místo vydání

Praha

Místo konání akce

Praha

Datum konání akce

11. 9. 2019

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—