Janosch Rieger
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Janosch Rieger has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Wolf-Jürgen Beyn
Bielefeld University
4 shared publications - Kyria Wawryk
Monash University, Australia
3 shared publications - Andreas T. Ernst
School of Mathematics, Monash University, Clayton, Australia
2 shared publications - Kevin N. Webster
Is a senior teaching fellow at Imperial College London in London, UK
2 shared publications - Martin Rasmussen
Department of Mathematics, Imperial College London 10 , London
2 shared publications - Andrew Eberhard
School of Mathematical Sciences, RMIT University, Melbourne, Australia
1 shared publication
Latest Publications
- 19 August 2026
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 52 (5) , 69
Generalized Gearhart-Koshy acceleration is a Krylov subspace method
- 19 August 2026
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 52 (5) , 69
Generalized Gearhart-Koshy acceleration is a Krylov subspace method
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Computational Dynamics
- Vol. 13, 56-85
Efficient space-time discretizations for tracking the boundaries of reachable sets
The reachable sets of nonlinear control systems can in general only be numerically approximated, and are often very expensive to calculate. In this paper, we propose an algorithm that tracks only the boundaries of the reachable sets and that chooses the temporal and spatial discretizations in a non-uniform way to reduce the computational complexity.
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Computational Dynamics
- Vol. 13, 56-85
Efficient space-time discretizations for tracking the boundaries of reachable sets
The reachable sets of nonlinear control systems can in general only be numerically approximated, and are often very expensive to calculate. In this paper, we propose an algorithm that tracks only the boundaries of the reachable sets and that chooses the temporal and spatial discretizations in a non-uniform way to reduce the computational complexity.
- Open Access
Restriction and interpolation operators for digital images and their boundaries
The aim of this paper is to provide a coherent framework for transforming boundary pairs of digital images from one resolution to another without knowledge of the full images. It is intended to facilitate the simultaneous usage of multiresolution processing and boundary reduction, primarily for algorithms in computational dynamics and computational control theory.
Open AccessRestriction and interpolation operators for digital images and their boundaries
The aim of this paper is to provide a coherent framework for transforming boundary pairs of digital images from one resolution to another without knowledge of the full images. It is intended to facilitate the simultaneous usage of multiresolution processing and boundary reduction, primarily for algorithms in computational dynamics and computational control theory.
- Open Access
- 23 April 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 318 (2) , 656-669
A robust optimization approach for a two-player force-design game
- 23 April 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 318 (2) , 656-669
Open AccessA robust optimization approach for a two-player force-design game
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Computational Dynamics
- Vol. 11 (2) , 153-173
Towards optimal space-time discretization for reachable sets of nonlinear control systems
Reachable sets of nonlinear control systems can in general only be approximated numerically, and these approximations are typically very expensive to compute. In this paper, we explore a strategy for choosing the temporal and spatial discretizations of Euler's method for reachable set computation in a non-uniform way to improve the performance of the method.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Computational Dynamics
- Vol. 11 (2) , 153-173
Towards optimal space-time discretization for reachable sets of nonlinear control systems
Reachable sets of nonlinear control systems can in general only be approximated numerically, and these approximations are typically very expensive to compute. In this paper, we explore a strategy for choosing the temporal and spatial discretizations of Euler's method for reachable set computation in a non-uniform way to improve the performance of the method.
- 2 February 2023
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 92 (341) , 1251-1272
Generalized Gearhart-Koshy acceleration for the Kaczmarz method
The Kaczmarz method is an iterative numerical method for solving large and sparse rectangular systems of linear equations. Gearhart, Koshy and Tam have developed an acceleration technique for the Kaczmarz method that minimizes the distance to the desired solution in the direction of a full Kaczmarz step. The present paper generalizes this technique to an acceleration scheme that minimizes the Euclidean norm error over an affine subspace spanned by a number of previous iterates and one additional cycle of the Kaczmarz method. The key challenge is to find a formulation in which all parameters of the least-squares problem defining the unique minimizer are known, and to solve this problem efficiently. When only a single Kaczmarz cycle is considered, the proposed affine search is more effective than the Gearhart-Koshy/Tam line-search, which in turn is more effective than the underlying Kaczmarz method. A numerical experiment from the context of computerized tomography suggests that the proposed affine search has the potential to outperform the the Gearhart-Koshy/Tam line-search and the underlying Kaczmarz method in terms of the computational cost that is needed to achieve a given error tolerance.
- 2 February 2023
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 92 (341) , 1251-1272
Generalized Gearhart-Koshy acceleration for the Kaczmarz method
The Kaczmarz method is an iterative numerical method for solving large and sparse rectangular systems of linear equations. Gearhart, Koshy and Tam have developed an acceleration technique for the Kaczmarz method that minimizes the distance to the desired solution in the direction of a full Kaczmarz step. The present paper generalizes this technique to an acceleration scheme that minimizes the Euclidean norm error over an affine subspace spanned by a number of previous iterates and one additional cycle of the Kaczmarz method. The key challenge is to find a formulation in which all parameters of the least-squares problem defining the unique minimizer are known, and to solve this problem efficiently. When only a single Kaczmarz cycle is considered, the proposed affine search is more effective than the Gearhart-Koshy/Tam line-search, which in turn is more effective than the underlying Kaczmarz method. A numerical experiment from the context of computerized tomography suggests that the proposed affine search has the potential to outperform the the Gearhart-Koshy/Tam line-search and the underlying Kaczmarz method in terms of the computational cost that is needed to achieve a given error tolerance.
- 2 December 2022
- Published by Springer Nature in Journal of Global Optimization
- Vol. 86 (2) , 521-543
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
- 2 December 2022
- Published by Springer Nature in Journal of Global Optimization
- Vol. 86 (2) , 521-543
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 27 (1) , 555-568
A learning-enhanced projection method for solving convex feasibility problems
We propose a generalization of the method of cyclic projections, which uses the lengths of projection steps carried out in the past to learn about the geometry of the problem and decides on this basis which projections to carry out in the future. We prove the convergence of this algorithm and illustrate its behavior in a first numerical study.
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 27 (1) , 555-568
A learning-enhanced projection method for solving convex feasibility problems
We propose a generalization of the method of cyclic projections, which uses the lengths of projection steps carried out in the past to learn about the geometry of the problem and decides on this basis which projections to carry out in the future. We prove the convergence of this algorithm and illustrate its behavior in a first numerical study.
- 7 August 2020
- Published by Springer Nature in Journal of Global Optimization
- Vol. 79 (3) , 593-615
A Galerkin approach to optimization in the space of convex and compact subsets of ${\mathbb {R}}^d$- 7 August 2020
- Published by Springer Nature in Journal of Global Optimization
- Vol. 79 (3) , 593-615
A Galerkin approach to optimization in the space of convex and compact subsets of ${\mathbb {R}}^d$- 28 February 2020
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 185 (1) , 34-43
Explicit Formula for Preimages of Relaxed One-Sided Lipschitz Mappings with Negative Lipschitz Constants: A Geometric Approach
- 28 February 2020
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 185 (1) , 34-43
Explicit Formula for Preimages of Relaxed One-Sided Lipschitz Mappings with Negative Lipschitz Constants: A Geometric Approach