Coarse-convex-compactification approach to numerical solution of nonconvex variational problems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10050658" target="_blank" >RIV/00216208:11320/10:10050658 - isvavai.cz</a>
Alternative codes found
RIV/61388998:_____/10:00351985
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Coarse-convex-compactification approach to numerical solution of nonconvex variational problems
Original language description
A 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 polynomialfunctionals. 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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
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
Numerical Functional Analysis and Optimization
ISSN
0163-0563
e-ISSN
—
Volume of the periodical
31
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
29
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—