Dr. Andreas M. Tillmann  

Email:

I am a PostDoc at the Visual Computing Institute (see my homepage there, which also contains preprint and software links) and the Chair of Operations Research, and head the "Data" unit of the profile area CompSE (Computational Science and Engineering) of RWTH Aachen University. I received my doctoral degree (Dr. rer. nat.) from TU Darmstadt in December 2013, and was an interim/visiting professor of mathematical optimization at TU Braunschweig in winter 2014/15. I joined RWTH Aachen in 2017.

My research interests focus on theoretical and practical aspects of optimization and complexity theory in areas like compressed sensing, signal and image processing, machine learning, operations research, and (discrete) geometrical problems. I am affiliated with the project "EXPRESS – EXploiting structure in comPREssed Sensing using Side constraints" within the DFG priority program CoSIP ("Compressed Sensing in Information Processing", SPP 1798) and was the principal investigator of the project "Efficient exact maximum-likelihood decoding and minimum-distance computation for binary linear codes" funded by the RWTH ERS StartUp/DFG Excellence Initiative. 

You can also find me on Google Scholar and on Research Gate.

Other profiles on the web:

Publications

Willamowski, F.J.L. and Tillmann, A.M.
 Minimizing Airplane Boarding Time. Transportation Science, 56(5):1196—1218, February 2022.
Tillmann, A.M.
 Computing the Spark: Mixed-Integer Programming for the (Vector) Matroid Girth Problem. Computational Optimization and Applications, 74(2):387—441, November 2019.
Tillmann, A.M. and Kobbelt, L.
 Structured Discrete Shape Approximation: Theoretical Complexity and Practical Algorithm. arXiv:1909.09217 [cs.CG], Visual Computing Institute & Chair of Operations Research, RWTH Aachen University, September 2019. https://arxiv.org/abs/1909.09217.
Brauer, C., Lorenz, D.A. and Tillmann, A.M.
 A Primal-Dual Homotopy Algorithm for L1-Minimization With L-infinity-Constraints. Computational Optimization and Applications, 70(2):443—478, February 2018.
Fischer, T., Hegde, G., Matter, F., Pesavento, M., Pfetsch, M.E. and Tillmann, A.M.
 Joint Antenna Selection and Phase-Only Beam Using Mixed-Integer Nonlinear Programming. Proc. WSA 2018, January 2018.
Lange, J.-H., Pfetsch, M.E., Seib, B.M. and Tillmann, A.M.
 Sparse Recovery with Integrality Constraints. arXiv:1608.08678 [cs.IT], RWTH Aachen, TU Darmstadt, August 2016.
Tillmann, A.M., Eldar, Y. C. and Mairal, J.
 Dictionary Learning from Phaseless Measurements. 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 4702—4706, January 2016.
Tillmann, A.M., Eldar, Y. C. and Mairal, J.
 DOLPHIn - Dictionary Learning for Phase Retrieval. IEEE Transactions on Signal Processing, 64(24):6485—6500, January 2016.
Tillmann, A.M.
 Equivalence of Linear Programming and Basis Pursuit. Proc. in Applied Mathematics and Mechanics (PAMM) 15(1), pages 735—738, November 2015.
Tillmann, A.M.
 On the Computational Intractability of Exact and Approximate Dictionary Learning. IEEE Signal Processing Letters, 22(1):45—49, January 2015.
Lorenz, D.A., Pfetsch, M.E. and Tillmann, A.M.
 Solving Basis Pursuit: Heuristic Optimality Check and Solver Comparison. ACM Transactions on Mathematical Software, 41(2):Art. No. 8, January 2015.
Tillmann, A.M., Gribonval, R. and Pfetsch, M.E.
 Projection Onto The Cosparse Set is NP-Hard. 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 7148—7152, May 2014.
Lorenz, D.A., Pfetsch, M.E. and Tillmann, A.M.
 An infeasible-point subgradient method using adaptive approximate projections. Computational Optimization and Applications, 57(2):271—306, January 2014.
Tillmann, A.M. and Pfetsch, M.E.
 The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing. IEEE Transactions on Information Theory, 60(2):1248—1259, January 2014.
Tillmann, A.M.
 Computational Aspects of Compressed Sensing. Doctoral Dissertation, TU Darmstadt, December 2013. ISBN 978-3-8439-1445-1.
Wenger, S., Ament, M., Guthe, S., Lorenz, D.A., Tillmann, A.M., Weiskopf, D. and Magnor, M.
 Visualization of Astronomical Nebulae via Distributed Multi-GPU Compressed Sensing Tomography. IEEE Transactions on Visualization and Computer Graphics, 18(12):2188—2197, January 2012.

Talks

EURO, Dublin, Ireland, June 23-26, 2019.
invite: Airplane Boarding: Complexity, Approximation and Exact Solution von Dr. A.M. Tillmann
ISMP (23rd International Symposium on Mathematical Programming), Bordeaux, France, July 1-6, 2018.
invite: Spark-MIP: Mixed-Integer Programming for the (Vector) Matroid Girth Problem von Dr. A.M. Tillmann
SPARS (Signal Processing with Adaptive Sparse Structured Representations), Lisbon, Portugal, June 5-8, 2017.
title: Computing the Spark of a Matrix von Dr. A.M. Tillmann
The Aussois Combinatorial Optimization Workshop, Aussois, France, January 9-13, 2017.
invite: Sparse Signal Reconstruction with Integrality Constraints von Dr. A.M. Tillmann
DWCAA (4th Dolomites Workshop on Constructive Approximation and Applications), Alba di Canazei, Italy, September 8-13, 2016.
invite: Exploiting hidden sparsity for image reconstruction from nonlinear measurements von Dr. A.M. Tillmann
Workshop "Data Science meets Optimization", Aachen, Germany, April 4-5, 2016.
invite: New Applications of Sparsity-Based Learning von Dr. A.M. Tillmann
ISMP (22nd International Symposium on Mathematical Programming), Pittsburgh, PA, United States, July 12-19, 2015.
invite: Branch & Cut Methods for Exact Sparse Recovery von Dr. A.M. Tillmann
GAMM (86th Annual Meeting of the Internat. Assoc. of Applied Math. and Mechanics), Lecce, Italy, March 23-27, 2015.
invite: Computational Aspects of Sparse Recovery von Dr. A.M. Tillmann
Workshop "Sparse Tomographic Reconstruction: Theoretical and Numerical Aspects", Heidelberg, Germany, March 19-20, 2015.
invite: Computational Aspects of Sparse Recovery von Dr. A.M. Tillmann
SPARS (Signal Processing with Adaptive Sparse Structured Representations), Lausanne, Switzerland, July 8-11, 2013.
title: The Computational Complexity of Spark, RIP, and NSP von Dr. A.M. Tillmann
MATHEON-Workshop "Sparse Representation of Functions: Analytic and Computational Aspects", Berlin, Germany, December 10-14, 2012.
invite: Branch & Cut for L0-Minimization von Dr. A.M. Tillmann
ISMP (21st International Symposium on Mathematical Programming), Berlin, Germany, August 19-24, 2012.
invite: Heuristic Optimality Check and Computational Solver Comparison for Basis Pursuit von Dr. A.M. Tillmann
SIAM Conference on Applied Linear Algebra, Valencia, Spain, June 18-22, 2012.
invite: Solving Basis Pursuit von Dr. A.M. Tillmann
CSSIP (Workshop on Compressed Sensing, Sparsity and Inverse Problems), Baunschweig, Germany, September 6-7, 2010.
title: An Infeasible-Point Subgradient Method and Computational Comparison for l¹-Minimization von Dr. A.M. Tillmann

RepORts

Willamowski, F.J.L. and Tillmann, A.M.
 Minimizing Airplane Boarding Time. repORt 2021—63, April 2021.
Puchert, C. and Tillmann, A.M.
 Exact separation of forbidden-set cuts associated with redundant parity checks of binary linear codes. repORt 2020—58, April 2020.
Willamowski, F.J.L. and Tillmann, A.M.
 Minimizing Airplane Boarding Time. repORt 2019—56, November 2019.
Tillmann, A.M.
 Computing the Spark: Mixed-Integer Programming for the (Vector) Matroid Girth Problem. repORt 2018—044, February 2018. Optimization Online E-Print ID 2018-03-6525.