January 2026 – present
Research Partners:
- Simion Stoilow Institute of Mathematics of the Romanian Academy (IMAR)
- Research Center for Logic, Optimization & Security (LOS), University of Bucharest
Research Team:
- Laurenţiu Leuştean (Principal Investigator)
- Nicoleta Dumitru
- Anda Ștefania Toma
ILDS Management Team:
Description:
Proof mining is an area of applied proof theory developed by Ulrich Kohlenbach beginning with the 1990s. The program of proof mining is concerned with the extraction of hidden finitary and combinatorial content (such as algorithms and effective bounds) from proofs that make use of highly infinitary principles. This research direction is related to Terence Tao’s proposal of “hard analysis”, which is based on finitary arguments, rather than on the infinitary ones from “soft analysis”.
The project is focused on new applications of proof mining in optimization and nonlinear analysis.
Publications:
- N. Dumitru, L. Leuștean, Quantitative asymptotic regularity and $T$-asymptotic regularity for the inexact generalized Halpern iteration, arXiv:2603.17105 [math.OC] (2026)
Talks:
- L. Leuștean, Logic Colloquium 2026, Swansea, UK, June 29 – July 3, 2026
- L. Leuștean, The 17th French Romanian Colloquium of Applied Mathematics, Nancy, France, June 22 – 26, 2026
- N. Dumitru, 15th Workshop for Young Researchers in Mathematics, Iași, Romania, May 21-22, 2026