Number of the records: 1  

Coarse-convex-compactification approach to numerical solution of nonconvex variational problems

  1. 1.
    SYSNO ASEP0351985
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleCoarse-convex-compactification approach to numerical solution of nonconvex variational problems
    Author(s) Meziat, R. (CO)
    Roubíček, Tomáš (UT-L) RID, ORCID
    Patino, D. (CO)
    Number of authors3
    Source TitleNumerical Functional Analysis and Optimization. - : Taylor & Francis - ISSN 0163-0563
    Roč. 31, č. 4 (2010), s. 460-488
    Number of pages23 s.
    Publication formwww - www
    Languageeng - English
    CountryUS - United States
    Keywordsconvex approximations ; method of moments ; relaxed variational problems
    Subject RIVBA - General Mathematics
    CEZAV0Z20760514 - UT-L (2005-2011)
    UT WOS000278663200004
    DOI10.1080/01630560903574985
    AnnotationA numerical method for a (possibly non-convex) scalar variational problem is proposed. This method allows for computation of the Young-measure solution of the generalized relaxed version of the original problem and applies to those cases with polynomial functionals. The Young measures involved in the relaxed problem can be represented by their algebraic moments and also a finite-element mesh is used. Eventually, thus obtained convex semidefinite program can be solved by efficient specialized mathematical-programming solvers. This method is justified by convergence analysis and eventually tested on a 2-dimensional benchmark numerical example. It serves as an example how convex compactification can efficiently be used numerically if enough ``small'', i.e. enough coarse.
    WorkplaceInstitute of Thermomechanics
    ContactMarie Kajprová, kajprova@it.cas.cz, Tel.: 266 053 154 ; Jana Lahovská, jaja@it.cas.cz, Tel.: 266 053 823
    Year of Publishing2011
Number of the records: 1  

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