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”

Global weight optimization of frame structures with polynomial programming

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F23%3A00581872" target="_blank" >RIV/67985556:_____/23:00581872 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21110/23:00370153

  • Result on the web

    <a href="https://link.springer.com/article/10.1007/s00158-023-03715-5" target="_blank" >https://link.springer.com/article/10.1007/s00158-023-03715-5</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s00158-023-03715-5" target="_blank" >10.1007/s00158-023-03715-5</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Global weight optimization of frame structures with polynomial programming

  • Original language description

    Weight optimization of frame structures with continuous cross-section parametrization is a challenging non-convex problem that has traditionally been solved by local optimization techniques. Here, we exploit its inherent semi-algebraic structure and adopt the Lasserre hierarchy of relaxations to compute the global minimizers. While this hierarchy generates a natural sequence of lower bounds, we show, under mild assumptions, how to project the relaxed solutions onto the feasible set of the original problem and thus construct feasible upper bounds. Based on these bounds, we develop a simple sufficient condition of global Ɛ-optimality. Finally, we prove that the optimality gap converges to zero in the limit if the set of global minimizers is convex. We demonstrate these results by means of two academic illustrations.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2023

  • 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

  • Name of the periodical

    Structural and Multidisciplinary Optimization

  • ISSN

    1615-147X

  • e-ISSN

    1615-1488

  • Volume of the periodical

    66

  • Issue of the periodical within the volume

    12

  • Country of publishing house

    DE - GERMANY

  • Number of pages

    10

  • Pages from-to

    257

  • UT code for WoS article

    001124449100003

  • EID of the result in the Scopus database

    2-s2.0-85179724837