375 citations · 854 across the 8 of their papers we have counts for
9 papers
Characterizing and Enumerating Walsh-Hadamard Transform Algorithms
François Serre, Markus Püschel
We propose a way of characterizing the algorithms computing a Walsh-Hadamard transform that consist of a sequence of arrays of butterflies () inter…
Distributed Optimization With Local Domains: Applications in MPC and Network Flows
João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar +1
In this paper we consider a network with nodes, where each node has exclusive access to a local cost function. Our contribution is a communication-efficient distributed algorit…
D-ADMM: A Communication-Efficient Distributed Algorithm For Separable Optimization
João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar +1
We propose a distributed algorithm, named Distributed Alternating Direction Method of Multipliers (D-ADMM), for solving separable optimization problems in networks of interconnecte…
A Proof of Convergence For the Alternating Direction Method of Multipliers Applied to Polyhedral-Constrained Functions
João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar +1
We give a general proof of convergence for the Alternating Direction Method of Multipliers (ADMM). ADMM is an optimization algorithm that has recently become very popular due to it…
Distributed Basis Pursuit
João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar +1
We propose a distributed algorithm for solving the optimization problem Basis Pursuit (BP). BP finds the least L1-norm solution of the underdetermined linear system Ax = b and is u…
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for Polynomial Transforms Based on Induction
Aliaksei Sandryhaila, Jelena Kovacevic, Markus Pueschel
A polynomial transform is the multiplication of an input vector $x\in\C^n$ by a matrix $\PT_{b,α}\in\C^{n\times n},$ whose -th element is defined as for pol…
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
Markus Pueschel, Jose M. F. Moura
This paper presents a systematic methodology based on the algebraic theory of signal processing to classify and derive fast algorithms for linear transforms. Instead of manipulatin…
Algebraic Signal Processing Theory
Markus Püschel, José M. F. Moura
This paper presents an algebraic theory of linear signal processing. At the core of algebraic signal processing is the concept of a linear signal model defined as a triple (A, M, p…
Fast Quantum Fourier Transforms for a Class of Non-abelian Groups
Markus Pueschel, Martin Roetteler, Thomas Beth
An algorithm is presented allowing the construction of fast Fourier transforms for any solvable group on a classical computer. The special structure of the recursion formula being…