Institute of Information Theory and Automation

You are here

Bibliography

Conference Paper (international conference)

Adaptive approximation algorithm for relaxed optimization problems

Roubíček Tomáš, Kružík Martin

: Proceedings of the Conference Fast Solution of Discretized Optimization Problems, p. 242-254 , Eds: Hoffmann K. H., Hoppe R. H. W., Schultz V.

: Birkhäuser, (Basel 2001)

: Fast Solution of Discretized Optimization Problems, (Berlin, DE, 12.06.2000-14.06.2000)

: AV0Z1075907

: IAA1075005, GA AV ČR, GA201/00/0768, GA ČR

: Young measures, DiPerna-Majda measures, approximation

(eng): 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.

: 12A

: BA

2019-01-07 08:39