Adaptive approximation algorithm for relaxed optimization problems.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F01%3A16010190" target="_blank" >RIV/67985556:_____/01:16010190 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Adaptive approximation algorithm for relaxed optimization problems.
Original language description
Nonconvex optimization problems need a relaxation to handle effectively fast oscillation (and possibly also concentration) effects. This uses Young measures or their generalizations. Approximation of the relaxed problem can then be made by various ways,but computationally the most effective way appears to use adaptively a maximum principle (if it forms also a sufficient optimality condition) with the Hamiltonian guessed approximately from a previous iteration, e.g. from a coarser mesh.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
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)
Others
Publication year
2001
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
Proceedings of the Conference Fast Solution of Discretized Optimization Problems.
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
13
Pages from-to
242-254
Publisher name
Birkhäuser
Place of publication
Basel
Event location
Berlin [DE]
Event date
Jun 12, 2000
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—