Optimization problems over rearrangement classes arise in various areas such as mathematics, fluid mechanics, biology, and finance. When the generator of the rearrangement class is two-valued, they reduce to shape optimization and free boundary problems which can exhibit intriguing symmetry breaking phenomena. A robust framework is required for computable analysis of these problems. In this paper, as a first step towards such a robust framework, we provide oracle Turing machines that compute the distribution function, decreasing rearrangement, and linear rearrangement optimizers, with respect to functions that are continuous and have no significant flat zones. This assumption on the reference function is necessary, as otherwise, the aforementioned operations may not be computable. We prove that the results can be computed to within any degree of accuracy, conforming to the framework of Type-II Theory of Effectivity.
CITATION STYLE
Farjudian, A. (2019). Computable analysis of linear rearrangement optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11436 LNCS, pp. 172–187). Springer Verlag. https://doi.org/10.1007/978-3-030-14812-6_11
Mendeley helps you to discover research relevant for your work.