2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DS2025★ 1 cited
Efficiently Finding All Minimal and Shortest Absent Subsequences in a String
Florin Manea, Tina Ringleb, Stefan Siemer +1
Given a string , another string is said to be a subsequence of if can be obtained from by removing some of its letters; on the other hand, is called an absen…
math.NA2024
On inertial Levenberg-Marquardt type methods for solving nonlinear ill-posed operator equations
Antonio Leitão, Joel C. Rabelo, Dirk A. Lorenz +1
In these notes we propose and analyze an inertial type method for obtaining stable approximate solutions to nonlinear ill-posed operator equations. The method is based on the Leven…
math.OC2023★ 2 cited
Minimal error momentum Bregman-Kaczmarz
Dirk A. Lorenz, Maximilian Winkler
The Bregman-Kaczmarz method is an iterative method which can solve strongly convex problems with linear constraints and uses only one or a selected number of rows of the system mat…