Number of the records: 1  

Inverse truss design as a conic mathematical program with equilibrium constraints

  1. 1.
    SYSNO ASEP0477818
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleInverse truss design as a conic mathematical program with equilibrium constraints
    Author(s) Kočvara, Michal (UTIA-B) RID, ORCID
    Outrata, Jiří (UTIA-B) RID, ORCID
    Source TitleDiscrete and Continuous Dynamical systems - Series S, Series S. - : AIMS Press - ISSN 1937-1632
    Roč. 10, č. 6 (2017), s. 1329-1350
    Number of pages22 s.
    Publication formPrint - P
    Languageeng - English
    CountryUS - United States
    Keywordsconic optimization ; truss topology optimization ; mathematical programs with equilibrium constraints
    Subject RIVBA - General Mathematics
    OECD categoryApplied mathematics
    R&D ProjectsGA15-00735S GA ČR - Czech Science Foundation (CSF)
    Institutional supportUTIA-B - RVO:67985556
    UT WOS000423844000007
    EID SCOPUS85021051439
    DOI10.3934/dcdss.2017071
    AnnotationWe formulate an inverse optimal design problem as a Mathematical Programming problem with Equilibrium Constraints (MPEC). The equilibrium constraints are in the form of a second-order conic optimization problem. Using the so-called Implicit Programming technique, we reformulate the bilevel optimization problem as a single-level nonsmooth nonconvex problem. The major part of the article is devoted to the computation of a subgradient of the resulting composite objective function. The article is concluded by numerical examples demonstrating, for the first time, that the Implicit Programming technique can be efficiently used in the numerical solution of MPECs with conic constraints on the lower level.
    WorkplaceInstitute of Information Theory and Automation
    ContactMarkéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
    Year of Publishing2018
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.