Timo de Wolff
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Timo de Wolff has a total of 65 co-authors. Here are the top co-authors by number of shared publications:
- Janin Heuer
Technische Universität Braunschweig, Institut für Analysis und Algebra, AG Algebra, Universitätsplatz 2, 38106 Braunschweig, Germany
6 shared publications - Elisenda Feliu
Department of Mathematical Sciences, University of Copenhagen, Copenhagen, Denmark
4 shared publications - Oğuzhan Yürük
Institute of Analysis and Algebra, Braunschweig, Germany
3 shared publications - Birte Ostermann
Technische Universität Braunschweig
2 shared publications - Christoph Brauer
Institute of Analysis and Algebra Technical University of Braunschweig Braunschweig Germany
2 shared publications - Dirk Pflüger
University of Stuttgart
2 shared publications
Latest Publications
- Open Access
- 22 October 2026
- Published by Elsevier in Composites Part A: Applied Science and Manufacturing
- Vol. 213
Voronoi-based vacuum leakage detection in composite manufacturing
- 22 October 2026
- Published by Elsevier in Composites Part A: Applied Science and Manufacturing
- Vol. 213
Open AccessVoronoi-based vacuum leakage detection in composite manufacturing
- 9 March 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 191
A speed-up for Helsgaun’s TSP heuristic by relaxing the positive gain criterion
- 9 March 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 191
A speed-up for Helsgaun’s TSP heuristic by relaxing the positive gain criterion
- Open Access
- 5 August 2025
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 132
The duality of SONC: Advances in circuit-based certificates
- 5 August 2025
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 132
Open AccessThe duality of SONC: Advances in circuit-based certificates
- Open Access
Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems
Quadratic unconstrained binary optimization problems (QUBOs) are intensively discussed in the realm of quantum computing and polynomial optimization. We provide a vast experimental study of semidefinite programming (SDP) relaxations of QUBOs using sums of squares methods and on Hamiltonian Updates. We test on QUBO reformulations of industry-based instances of the (open) vehicle routing problem and the (affinity-based) slotting problem -- two common combinatorial optimization problems in logistics. Beyond comparing the performance of various methods and software, our results reaffirm that optimizing over non-generic, real-world instances provides additional challenges. In consequence, this study underscores recent developments towards structure exploitation and specialized solver development for the used methods and simultaneously shows that further research is necessary in this direction both on the classical and the quantum side.
Open AccessBenchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems
Quadratic unconstrained binary optimization problems (QUBOs) are intensively discussed in the realm of quantum computing and polynomial optimization. We provide a vast experimental study of semidefinite programming (SDP) relaxations of QUBOs using sums of squares methods and on Hamiltonian Updates. We test on QUBO reformulations of industry-based instances of the (open) vehicle routing problem and the (affinity-based) slotting problem -- two common combinatorial optimization problems in logistics. Beyond comparing the performance of various methods and software, our results reaffirm that optimizing over non-generic, real-world instances provides additional challenges. In consequence, this study underscores recent developments towards structure exploitation and specialized solver development for the used methods and simultaneously shows that further research is necessary in this direction both on the classical and the quantum side.
- 24 January 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 134 (3) , 030201
Revealing Hidden Physical Nonclassicality with Non-negative Polynomials
Understanding quantum phenomena that go beyond classical concepts is a focus of modern quantum physics. Here, we show how the theory of non-negative polynomials emerging around Hilbert's 17th problem, can be used to optimally exploit data capturing the nonclassical nature of light. Specifically, we show that non-negative polynomials can reveal nonclassicality in data even when it is hidden from standard detection methods up to now. Moreover, the abstract language of non-negative polynomials also leads to a unified mathematical approach to nonclassicality for light and spin systems, allowing us to map methods for one to the other. Conversely, the physical problems arising also inspire several mathematical insights into characterization of non-negative polynomials.
- 24 January 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 134 (3) , 030201
Revealing Hidden Physical Nonclassicality with Non-negative Polynomials
Understanding quantum phenomena that go beyond classical concepts is a focus of modern quantum physics. Here, we show how the theory of non-negative polynomials emerging around Hilbert's 17th problem, can be used to optimally exploit data capturing the nonclassical nature of light. Specifically, we show that non-negative polynomials can reveal nonclassicality in data even when it is hidden from standard detection methods up to now. Moreover, the abstract language of non-negative polynomials also leads to a unified mathematical approach to nonclassicality for light and spin systems, allowing us to map methods for one to the other. Conversely, the physical problems arising also inspire several mathematical insights into characterization of non-negative polynomials.
- Open Access
- 9 September 2024
- Published by Wiley in Small Methods
- Vol. 8 (12) , e2400549
Chirality Detection in Scanning Tunneling Microscopy Data Using Artificial Intelligence
Enantiospecific effects play an uprising role in chemistry and technical applications. Chiral molecular networks formed by self‐assembly processes at surfaces can be imaged by scanning probe microscopy (SPM). Low contrast and high noise in the topography map often interfere with the automatic image analysis using classical methods. The long SPM image acquisition times restrain Artificial Intelligence‐based methods requiring large training sets, leaving only tedious manual work, inducing human‐dependent errors and biased labeling. By generating realistic looking synthetic images, the acquisition of real datasets is avoided. Two state‐of‐the‐art object detection architectures are trained to localize and classify chiral unit‐cells in a regular molecular chiral network formed by self‐assembly of linear molecular bricks. The comparison of different architectures and datasets demonstrates that the training on purely synthetic data outperforms models trained using augmented datasets. A Faster R‐CNN model trained solely on synthetic data achieved an excellent mean average precision of 99% on real data. Hence this approach and the transfer to real data show high success, also highlighting the high robustness against experimental noise and different zoom levels across the full experimentally reasonable parameter range. The generalizability of this idea is demonstrated by achieving equally high performance on a different structure, too.
- 9 September 2024
- Published by Wiley in Small Methods
- Vol. 8 (12) , e2400549
Open AccessChirality Detection in Scanning Tunneling Microscopy Data Using Artificial Intelligence
Enantiospecific effects play an uprising role in chemistry and technical applications. Chiral molecular networks formed by self‐assembly processes at surfaces can be imaged by scanning probe microscopy (SPM). Low contrast and high noise in the topography map often interfere with the automatic image analysis using classical methods. The long SPM image acquisition times restrain Artificial Intelligence‐based methods requiring large training sets, leaving only tedious manual work, inducing human‐dependent errors and biased labeling. By generating realistic looking synthetic images, the acquisition of real datasets is avoided. Two state‐of‐the‐art object detection architectures are trained to localize and classify chiral unit‐cells in a regular molecular chiral network formed by self‐assembly of linear molecular bricks. The comparison of different architectures and datasets demonstrates that the training on purely synthetic data outperforms models trained using augmented datasets. A Faster R‐CNN model trained solely on synthetic data achieved an excellent mean average precision of 99% on real data. Hence this approach and the transfer to real data show high success, also highlighting the high robustness against experimental noise and different zoom levels across the full experimentally reasonable parameter range. The generalizability of this idea is demonstrated by achieving equally high performance on a different structure, too.
- Open Access
- 16 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 361-370
Initial Application of SONC to Lyapunov Stability of Dynamical Systems
Certifying the stability of dynamical systems is a central and challenging task in control theory and systems analysis. To tackle these problems we present an algorithmic approach to finding polynomial Lyapunov functions. Our method relies on sums of nonnegative circuit functions (SONC), a certificate of nonnegativity of real polynomials. We show that both the problem of verifying as well as the more difficult task of finding Lyapunov functions can be carried out via relative entropy programming when using SONC certificates. This approach is analogue yet independent to finding Lyapunov functions via sums of squares (SOS) certificates and semidefinite programming. We construct an algorithm for our results, and examples computed on its implementation showing its applicability.
- 16 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 361-370
Open AccessInitial Application of SONC to Lyapunov Stability of Dynamical Systems
Certifying the stability of dynamical systems is a central and challenging task in control theory and systems analysis. To tackle these problems we present an algorithmic approach to finding polynomial Lyapunov functions. Our method relies on sums of nonnegative circuit functions (SONC), a certificate of nonnegativity of real polynomials. We show that both the problem of verifying as well as the more difficult task of finding Lyapunov functions can be carried out via relative entropy programming when using SONC certificates. This approach is analogue yet independent to finding Lyapunov functions via sums of squares (SOS) certificates and semidefinite programming. We construct an algorithm for our results, and examples computed on its implementation showing its applicability.
- 3 April 2024
- Published by World Scientific Pub Co Pte Ltd in Analysis and Applications
- Vol. 22 (03) , 569-617
Learning variational models with unrolling and bilevel optimization
In this paper, we consider the problem of learning variational models in the context of supervised learning via risk minimization. Our goal is to provide a deeper understanding of the two approaches of learning of variational models via bilevel optimization and via algorithm unrolling. The former considers the variational model as a lower level optimization problem below the risk minimization problem, while the latter replaces the lower level optimization problem by an algorithm that solves said problem approximately. Both approaches are used in practice, but unrolling is much simpler from a computational point of view. To analyze and compare the two approaches, we consider a simple toy model, and compute all risks and the respective estimators explicitly. We show that unrolling can be better than the bilevel optimization approach, but also that the performance of unrolling can depend significantly on further parameters, sometimes in unexpected ways: While the stepsize of the unrolled algorithm matters a lot (and learning the stepsize gives a significant improvement), the number of unrolled iterations plays a minor role.
- 3 April 2024
- Published by World Scientific Pub Co Pte Ltd in Analysis and Applications
- Vol. 22 (03) , 569-617
Learning variational models with unrolling and bilevel optimization
In this paper, we consider the problem of learning variational models in the context of supervised learning via risk minimization. Our goal is to provide a deeper understanding of the two approaches of learning of variational models via bilevel optimization and via algorithm unrolling. The former considers the variational model as a lower level optimization problem below the risk minimization problem, while the latter replaces the lower level optimization problem by an algorithm that solves said problem approximately. Both approaches are used in practice, but unrolling is much simpler from a computational point of view. To analyze and compare the two approaches, we consider a simple toy model, and compute all risks and the respective estimators explicitly. We show that unrolling can be better than the bilevel optimization approach, but also that the performance of unrolling can depend significantly on further parameters, sometimes in unexpected ways: While the stepsize of the unrolled algorithm matters a lot (and learning the stepsize gives a significant improvement), the number of unrolled iterations plays a minor role.
- Open Access
A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
The Traveling Salesman Problem (TSP) is one of the most extensively researched and widely applied combinatorial optimization problems. It is NP-hard even in the symmetric and metric case. Building upon elaborate research, state-of-the-art exact solvers such as CONCORDE can solve TSP instances with several ten thousand vertices. A key ingredient for these integer programming approaches are fast heuristics to find a good initial solution, in particular the Lin-Kernighan-Helsgaun (LKH) heuristic. For instances with few hundred vertices heuristics like LKH often find an optimal solution. In this work we develop variations of LKH that perform significantly better on large instances. LKH repeatedly improves an initially random tour by exchanging edges along alternating circles. Thereby, it respects several criteria designed to quickly find alternating circles that give a feasible improvement of the tour. Among those criteria, the positive gain criterion stayed mostly untouched in previous research. It requires that, while constructing an alternating circle, the total gain has to be positive after each pair of edges. We relax this criterion carefully leading to improvement steps hitherto undiscovered by LKH. We confirm this improvement experimentally via extensive simulations on various benchmark libraries for TSP. Our computational study shows that for large instances our method is on average 13% faster than the latest version of LKH.
Open AccessA Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
The Traveling Salesman Problem (TSP) is one of the most extensively researched and widely applied combinatorial optimization problems. It is NP-hard even in the symmetric and metric case. Building upon elaborate research, state-of-the-art exact solvers such as CONCORDE can solve TSP instances with several ten thousand vertices. A key ingredient for these integer programming approaches are fast heuristics to find a good initial solution, in particular the Lin-Kernighan-Helsgaun (LKH) heuristic. For instances with few hundred vertices heuristics like LKH often find an optimal solution. In this work we develop variations of LKH that perform significantly better on large instances. LKH repeatedly improves an initially random tour by exchanging edges along alternating circles. Thereby, it respects several criteria designed to quickly find alternating circles that give a feasible improvement of the tour. Among those criteria, the positive gain criterion stayed mostly untouched in previous research. It requires that, while constructing an alternating circle, the total gain has to be positive after each pair of edges. We relax this criterion carefully leading to improvement steps hitherto undiscovered by LKH. We confirm this improvement experimentally via extensive simulations on various benchmark libraries for TSP. Our computational study shows that for large instances our method is on average 13% faster than the latest version of LKH.
- Open Access
Realistic Runtime Analysis for Quantum Simplex Computation
In recent years, strong expectations have been raised for the possible power of quantum computing for solving difficult optimization problems, based on theoretical, asymptotic worst-case bounds. Can we expect this to have consequences for Linear and Integer Programming when solving instances of practically relevant size, a fundamental goal of Mathematical Programming, Operations Research and Algorithm Engineering? Answering this question faces a crucial impediment: The lack of sufficiently large quantum platforms prevents performing real-world tests for comparison with classical methods. In this paper, we present a quantum analog for classical runtime analysis when solving real-world instances of important optimization problems. To this end, we measure the expected practical performance of quantum computers by analyzing the expected gate complexity of a quantum algorithm. The lack of practical quantum platforms for experimental comparison is addressed by hybrid benchmarking, in which the algorithm is performed on a classical system, logging the expected cost of the various subroutines that are employed by the quantum versions. In particular, we provide an analysis of quantum methods for Linear Programming, for which recent work has provided asymptotic speedup through quantum subroutines for the Simplex method. We show that a practical quantum advantage for realistic problem sizes would require quantum gate operation times that are considerably below current physical limitations.
Open AccessRealistic Runtime Analysis for Quantum Simplex Computation
In recent years, strong expectations have been raised for the possible power of quantum computing for solving difficult optimization problems, based on theoretical, asymptotic worst-case bounds. Can we expect this to have consequences for Linear and Integer Programming when solving instances of practically relevant size, a fundamental goal of Mathematical Programming, Operations Research and Algorithm Engineering? Answering this question faces a crucial impediment: The lack of sufficiently large quantum platforms prevents performing real-world tests for comparison with classical methods. In this paper, we present a quantum analog for classical runtime analysis when solving real-world instances of important optimization problems. To this end, we measure the expected practical performance of quantum computers by analyzing the expected gate complexity of a quantum algorithm. The lack of practical quantum platforms for experimental comparison is addressed by hybrid benchmarking, in which the algorithm is performed on a classical system, logging the expected cost of the various subroutines that are employed by the quantum versions. In particular, we provide an analysis of quantum methods for Linear Programming, for which recent work has provided asymptotic speedup through quantum subroutines for the Simplex method. We show that a practical quantum advantage for realistic problem sizes would require quantum gate operation times that are considerably below current physical limitations.