All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

ON OPTIMUM DESIGN OF FRAME STRUCTURES

The result's identifiers

  • Result code in 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>

  • Alternative codes found

    RIV/68407700:21230/20:00342259

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    ON OPTIMUM DESIGN OF FRAME STRUCTURES

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

    <a href="/en/project/EF16_019%2F0000778" target="_blank" >EF16_019/0000778: Center for advanced applied science</a><br>

  • Continuities

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

Others

  • Publication year

    2020

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    NMM 2019 Nano & Macro Mechanics

  • ISBN

    978-80-01-06720-8

  • ISSN

  • e-ISSN

    2336-5382

  • Number of pages

    9

  • Pages from-to

    117-125

  • Publisher name

    Czech Technical University in Prague

  • Place of publication

    Praha

  • Event location

    Praha

  • Event date

    Sep 11, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article