default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRalf Hannemann-Tamás
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j11]Tobias Ploch, Jens Deussen, Uwe Naumann, Alexander Mitsos, Ralf Hannemann-Tamás
:
Direct single shooting for dynamic optimization of differential-algebraic equation systems with optimization criteria embedded. Comput. Chem. Eng. 159: 107643 (2022)- 2020
- [j10]Eduardo S. Schultz, Ralf Hannemann-Tamás, Alexander Mitsos:
Guaranteed satisfaction of inequality state constraints in PDE-constrained optimization. Autom. 111 (2020) - [j9]Eduardo S. Schultz, Ralf Hannemann-Tamás, Alexander Mitsos:
Polynomial approximation of inequality path constraints in dynamic optimization. Comput. Chem. Eng. 135: 106732 (2020) - [j8]Tobias Ploch, Eric von Lieres, Wolfgang Wiechert, Alexander Mitsos, Ralf Hannemann-Tamás:
Simulation of differential-algebraic equation systems with optimization criteria embedded in Modelica. Comput. Chem. Eng. 140: 106920 (2020)
2010 – 2019
- 2018
- [j7]Jennifer Puschke, Hatim Djelassi, Johanna Kleinekorte, Ralf Hannemann-Tamás, Alexander Mitsos:
Robust dynamic optimization of batch processes under parametric uncertainty: Utilizing approaches from semi-infinite programs. Comput. Chem. Eng. 116: 253-267 (2018) - 2015
- [j6]René Schneider, Ralf Hannemann-Tamás, Wolfgang Marquardt:
An iterative partition-based moving horizon estimator with coupled inequality constraints. Autom. 61: 302-307 (2015) - [j5]Ralf Hannemann-Tamás, Diego A. Muñoz, Wolfgang Marquardt:
Adjoint Sensitivity Analysis for Nonsmooth Differential-Algebraic Equation Systems. SIAM J. Sci. Comput. 37(5) (2015) - [c4]Johannes Lotz, Uwe Naumann, Ralf Hannemann-Tamás, Tobias Ploch, Alexander Mitsos:
Higher-order Discrete Adjoint ODE Solver in C++ for Dynamic Optimization. ICCS 2015: 256-265 - 2014
- [c3]Ralf Hannemann-Tamás, Lars Struen Imsland:
Full algorithmic differentiation of a Rosenbrock-type method for direct single shooting. ECC 2014: 1242-1248 - 2013
- [j4]Ralf Hannemann-Tamás, Attila Gábor, Gábor Szederkényi, Katalin M. Hangos:
Model complexity reduction of chemical reaction networks using mixed-integer quadratic programming. Comput. Math. Appl. 65(10): 1575-1595 (2013) - 2012
- [j3]Moritz Schmitz, Ralf Hannemann-Tamás, Boris Gendler, Michael Förster, Wolfgang Marquardt, Uwe Naumann:
Software for Higher-order Sensitivity Analysis of Parametric DAEs. Simul. Notes Eur. 22(3-4): 163-168 (2012) - 2010
- [j2]Ralf Hannemann, Wolfgang Marquardt:
Continuous and Discrete Composite Adjoints for the Hessian of the Lagrangian in Shooting Algorithms for Dynamic Optimization. SIAM J. Sci. Comput. 31(6): 4675-4695 (2010) - [c2]Diego A. Muñoz, Ralf Hannemann, Wolfgang Marquardt:
Input-constrained closed-loop systems with grazing bifurcations in optimal robust design. CACSD 2010: 1073-1078 - [c1]Ralf Hannemann, Wolfgang Marquardt, Uwe Naumann, Boris Gendler:
Discrete first- and second-order adjoints and automatic differentiation for the sensitivity analysis of dynamic models. ICCS 2010: 297-305
2000 – 2009
- 2009
- [j1]Claas Michalik, Ralf Hannemann, Wolfgang Marquardt:
Incremental single shooting - A robust method for the estimation of parameters in dynamical systems. Comput. Chem. Eng. 33(7): 1298-1305 (2009)
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-10-07 21:25 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:
