Andreas M. Tillmann

Orcid: 0000-0002-7744-836X

Affiliations:
  • Technische Universität Braunschweig, Braunschweig, Germany
  • RWTH Aachen University, Visual Computing Institute, Germany (former)
  • TU Darmstadt, Research Group Optimization, Germany (former)


According to our database1, Andreas M. Tillmann authored at least 21 papers between 2012 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Extended Successive Convex Approximation for Phase Retrieval With Dictionary Learning.
IEEE Trans. Signal Process., 2022

Minimizing Airplane Boarding Time.
Transp. Sci., 2022

2021
Cardinality Minimization, Constraints, and Regularization: A Survey.
CoRR, 2021

Structured discrete shape approximation: Theoretical complexity and practical algorithm.
Comput. Geom., 2021

A Parallel Algorithm for Phase Retrieval with Dictionary Learning.
Proceedings of the IEEE International Conference on Acoustics, 2021

2020
Exact Separation of Forbidden-Set Cuts Associated With Redundant Parity Checks of Binary Linear Codes.
IEEE Commun. Lett., 2020

Sparse recovery with integrality constraints.
Discret. Appl. Math., 2020

2019
Computing the spark: mixed-integer programming for the (vector) matroid girth problem.
Comput. Optim. Appl., 2019

2018
A primal-dual homotopy algorithm for \(\ell _{1}\) -minimization with \(\ell _{\infty }\) -constraints.
Comput. Optim. Appl., 2018

Joint Antenna Selection and Phase-only Beamforming using Mixed-Integer Nonlinear Programming.
Proceedings of the 22nd International ITG Workshop on Smart Antennas, 2018

2016
DOLPHIn - Dictionary Learning for Phase Retrieval.
IEEE Trans. Signal Process., 2016

A Primal-Dual Homotopy Algorithm for ℓ<sub>1</sub>-Minimization with ℓ<sub>∞</sub>-Constraints.
CoRR, 2016

Dictionary learning from phaseless measurements.
Proceedings of the 2016 IEEE International Conference on Acoustics, 2016

2015
Solving Basis Pursuit: Heuristic Optimality Check and Solver Comparison.
ACM Trans. Math. Softw., 2015

On the Computational Intractability of Exact and Approximate Dictionary Learning.
IEEE Signal Process. Lett., 2015

2014
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing.
IEEE Trans. Inf. Theory, 2014

An infeasible-point subgradient method using adaptive approximate projections.
Comput. Optim. Appl., 2014

Projection onto the cosparse set is NP-hard.
Proceedings of the IEEE International Conference on Acoustics, 2014

2013
Projection Onto The k-Cosparse Set is NP-Hard
CoRR, 2013

2012
Visualization of Astronomical Nebulae via Distributed Multi-GPU Compressed Sensing Tomography.
IEEE Trans. Vis. Comput. Graph., 2012

The Computational Complexity of RIP, NSP, and Related Concepts in Compressed Sensing
CoRR, 2012


  Loading...