M
Marc E. Pfetsch
Researcher at Technische Universität Darmstadt
Publications - 156
Citations - 3926
Marc E. Pfetsch is an academic researcher from Technische Universität Darmstadt. The author has contributed to research in topics: Polytope & Integer programming. The author has an hindex of 29, co-authored 146 publications receiving 3294 citations. Previous affiliations of Marc E. Pfetsch include Braunschweig University of Technology & Zuse Institute Berlin.
Papers
More filters
Computing Restricted Isometry Constants via Mixed-Integer Semidefinite Programming
Tristan Gally,Marc E. Pfetsch +1 more
TL;DR: This paper proposes a mixed-integer semidefinite programming approach for computing optimal constants in compressed sensing and also subsumes sparse principal component analysis.
Posted Content
A Compact Formulation for the $\ell_{2,1}$ Mixed-Norm Minimization Problem
TL;DR: This work derives an equivalent, compact reformulation of the $\ell _{2,1}$ mixed-norm minimization problem that provides new insights on the relation between different existing approaches for jointly sparse signal reconstruction, and proves the exact equivalence between the compact problem formulation and the atomic- norm minimization.
Journal ArticleDOI
Computing Optimal Discrete Morse Functions
Michael Joswig,Marc E. Pfetsch +1 more
TL;DR: It is shown that computing optimal Morse matchings is NP -hard and an integer programming formulation for the problem is given and first polyhedral results for the corresponding polytope are presented.
Journal ArticleDOI
An infeasible-point subgradient method using adaptive approximate projections
TL;DR: In this article, a subgradient method for the minimization of nonsmooth convex functions over a convex set is proposed, where adaptive approximate projections only require to move within a certain distance of the exact projections (which decreases in the course of the algorithm).
Book ChapterDOI
Branch-cut-and-propagate for the maximum k-colorable subgraph problem with symmetry
Tim Januschowski,Marc E. Pfetsch +1 more
TL;DR: This work investigates the integration of a branch-and-cut algorithm for solving the maximum k-colorable subgraph problem with constraint propagation techniques to handle the symmetry arising from the graph.