9 citations · 20 across the 4 of their papers we have counts for
6 papers
Extended Randomized Kaczmarz Method for Sparse Least Squares and Impulsive Noise Problems
Frank Schöpfer, Dirk A Lorenz, Lionel Tondji +1
The Extended Randomized Kaczmarz method is a well known iterative scheme which can find the Moore-Penrose inverse solution of a possibly inconsistent linear system and requires onl…
Linear convergence of the Randomized Sparse Kaczmarz Method
Frank Schöpfer, Dirk A. Lorenz
The randomized version of the Kaczmarz method for the solution of linear systems is known to converge linearly in expectation. In this work we extend this result and show that the…
A CG-type method in Banach spaces with an application to computerized tomography
Frederik Heber, Frank Schöpfer, Thomas Schuster
Conjugate Gradient (CG) methods are one of the most effective iterative methods to solve linear equations in Hilbert spaces. So far, they have been inherently bound to these spaces…
Cost-Optimal Operation of Energy Storage Units: Benefits of a Problem-Specific Approach
Lars Siemer, Frank Schöpfer, David Kleinhans
The integration of large shares of electricity produced by non-dispatchable Renewable Energy Sources (RES) leads to an increasingly volatile energy generation side, with temporary…
A sparse Kaczmarz solver and a linearized Bregman method for online compressed sensing
Dirk A. Lorenz, Stephan Wenger, Frank Schöpfer +1
An algorithmic framework to compute sparse or minimal-TV solutions of linear systems is proposed. The framework includes both the Kaczmarz method and the linearized Bregman method…
The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
Dirk A. Lorenz, Frank Schöpfer, Stephan Wenger
The linearized Bregman method is a method to calculate sparse solutions to systems of linear equations. We formulate this problem as a split feasibility problem, propose an algorit…