default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJanosch Rieger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Jeffrey Christiansen, Andreas T. Ernst
, Janosch Rieger:
A robust optimization approach for a two-player force-design game. Eur. J. Oper. Res. 318(2): 656-669 (2024)- [i4]Janosch Rieger, Kyria Wawryk:
Restriction and interpolation operators for digital images and their boundaries. CoRR abs/2407.18511 (2024) - 2023
- [j14]Andreas T. Ernst, Lars Grüne, Janosch Rieger:
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems. J. Glob. Optim. 86(2): 521-543 (2023) - [i3]Janosch Rieger, Kyria Wawryk:
Towards optimal space-time discretizations for reachable sets of nonlinear systems. CoRR abs/2305.12727 (2023) - [i2]Markus Hegland, Janosch Rieger:
Generalized Gearhart-Koshy acceleration is a Krylov space method of a new type. CoRR abs/2311.18305 (2023) - 2022
- [j13]Janosch Rieger:
Generalized Gearhart-Koshy acceleration for the Kaczmarz method. Math. Comput. 92(341): 1251-1272 (2022) - [i1]Janosch Rieger:
Generalized Gearhart-Koshy acceleration for the Kaczmarz method. CoRR abs/2201.10118 (2022) - 2021
- [j12]Janosch Rieger:
A Galerkin approach to optimization in the space of convex and compact subsets of ${\mathbb {R}}^d$. J. Glob. Optim. 79(3): 593-615 (2021) - 2020
- [j11]Janosch Rieger, Matthew K. Tam:
Backward-Forward-Reflected-Backward Splitting for Three Operator Monotone Inclusions. Appl. Math. Comput. 381: 125248 (2020) - [j10]Andrew C. Eberhard, Boris S. Mordukhovich, Janosch Rieger:
Explicit Formula for Preimages of Relaxed One-Sided Lipschitz Mappings with Negative Lipschitz Constants: A Geometric Approach. J. Optim. Theory Appl. 185(1): 34-43 (2020)
2010 – 2019
- 2019
- [j9]Janosch Rieger:
Provably convergent implementations of the subdivision algorithm for the computation of invariant objects. Numerische Mathematik 142(1): 149-165 (2019) - 2017
- [j8]Martin Rasmussen, Janosch Rieger, Kevin N. Webster:
Approximation of reachable sets using optimal control and support vector machines. J. Comput. Appl. Math. 311: 68-83 (2017) - 2016
- [j7]Janosch Rieger, Tobias Weth:
Localized Solvability of Relaxed One-Sided Lipschitz Inclusions in Hilbert Spaces. SIAM J. Optim. 26(1): 227-246 (2016) - 2015
- [j6]Janosch Rieger:
Robust boundary tracking for reachable sets of nonlinear differential inclusions. Found. Comput. Math. 15(5): 1129-1150 (2015) - [j5]Wolf-Jürgen Beyn, Janosch Rieger:
An Iterative Method for Solving Relaxed One-Sided Lipschitz Algebraic Inclusions. J. Optim. Theory Appl. 164(1): 154-172 (2015) - 2014
- [j4]Janosch Rieger:
Semi-Implicit Euler Schemes for Ordinary Differential Inclusions. SIAM J. Numer. Anal. 52(2): 895-914 (2014) - 2013
- [j3]Janosch Rieger:
Implementing Galerkin Finite Element Methods for Semilinear Elliptic Differential Inclusions. Comput. Methods Appl. Math. 13(1): 95-118 (2013) - [j2]Janosch Rieger:
Non-convex systems of sets for numerical analysis. Computing 95(S1): 617-638 (2013)
2000 – 2009
- 2007
- [j1]Wolf-Jürgen Beyn, Janosch Rieger:
Numerical fixed grid methods for differential inclusions. Computing 81(1): 91-106 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 19:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
