1 citations · 1 across the 14 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.OC2019
A learning-enhanced projection method for solving convex feasibility problems
Janosch Rieger
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 d…
math.OC2019
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
Andreas Ernst, Lars Grüne, Janosch Rieger
We develop a new numerical method for approximating the infinite time reachable set of strictly stable linear control systems. By solving a linear program with a constraint that in…
math.FA2019
Explicit Formula for Preimages of Relaxed One-Sided Lipschitz Mappings with Negative Lipschitz Constants
Andrew C. Eberhard, Boris S. Mordukhovich, Janosch Rieger
This paper addresses Lipschitzian stability issues that play an important role in both theoretical and numerical aspects of variational analysis, optimization, and their applicatio…