Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society, the Mathematics of Computation (MCOM) is devoted to research articles of the highest quality in all areas of pure and applied mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.98.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


The homotopy method revisited: Computing solution paths of $\ell _1$-regularized problems
HTML articles powered by AMS MathViewer

by Bjoern Bringmann, Daniel Cremers, Felix Krahmer and Michael Moeller PDF
Math. Comp. 87 (2018), 2343-2364 Request permission


$\ell _1$-regularized linear inverse problems frequently arise in signal processing, image analysis, and statistics. The correct choice of the regularization parameter $t \in \mathbb {R}_{\geq 0}$ is a delicate issue. Instead of solving the variational problem for a fixed parameter, the idea of the homotopy method is to compute a complete solution path $u(t)$ as a function of $t$. In their celebrated paper A new approach to variable selection in least squares problems [IMA J. Numer. Anal. 20 (2000), no. 3, 389–403], Osborne, Presnell, and Turlach showed that the computational cost of this approach is often comparable to the cost of solving the corresponding least squares problem. Their analysis relies on the one-at-a-time condition, which requires that different indices enter or leave the support of the solution at distinct regularization parameters. In this paper, we introduce a generalized homotopy algorithm based on a nonnegative least squares problem, which does not require such a condition, and prove its termination after finitely many steps. At every point of the path, we give a full characterization of all possible directions. To illustrate our results, we discuss examples in which the standard homotopy method either fails or becomes infeasible. To the best of our knowledge, our algorithm is the first to provably compute a full piecewise linear and continuous solution path for an arbitrary combination of a measurement matrix and a data vector.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 49N45, 90C25, 62J07
  • Retrieve articles in all journals with MSC (2010): 49N45, 90C25, 62J07
Additional Information
  • Bjoern Bringmann
  • Affiliation: Department of Mathematics, University of California Los Angeles, 520 Portola Plaza, Los Angeles, California 90095
  • Email:
  • Daniel Cremers
  • Affiliation: Department of Computer Science, Technische Universität München, Informatik 9, Boltzmannstr. 3, D-85748 Garching bei München
  • MR Author ID: 644986
  • Email:
  • Felix Krahmer
  • Affiliation: Department of Mathematics, Technische Universität München, Boltzmannstr. 3, D-85748 Garching bei München
  • MR Author ID: 845768
  • Email:
  • Michael Moeller
  • Affiliation: Department of Electrical Engineering and Computer Science, Universität Siegen, Hölderlinstr. 3, D-57076 Siegen
  • MR Author ID: 974311
  • Email:
  • Received by editor(s): May 30, 2016
  • Received by editor(s) in revised form: April 6, 2017
  • Published electronically: December 14, 2017
  • Additional Notes: The second and fourth authors were supported by the ERC Starting Grant “ConvexVision”.
    The third author’s contribution was supported by the German Science Foundation DFG in context of the Emmy Noether junior research group KR 4512/1-1 (RaSenQuaSI)
  • © Copyright 2017 American Mathematical Society
  • Journal: Math. Comp. 87 (2018), 2343-2364
  • MSC (2010): Primary 49N45, 90C25, 62J07
  • DOI:
  • MathSciNet review: 3802438