default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Walther
Person information
- affiliation: Humboldt University of Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j37]Varadarajan Rengaraj, Sebastian Jost
, Franz Bethke, Christian Plessl, Hossein Mirhosseini, Andrea Walther, Thomas D. Kühne:
A Two-Step Machine Learning Method for Predicting the Formation Energy of Ternary Compounds. Comput. 11(5): 95 (2023)- [i8]Jannis Bulling, Benjamin Jurgelucks, Jens Prager, Andrea Walther:
Experimental validation of an inverse method for defect reconstruction in a 2D waveguide model. CoRR abs/2306.02880 (2023) - [i7]Moritz Piening, Fabian Altekrüger, Johannes Hertrich, Paul Hagemann, Andrea Walther, Gabriele Steidl:
Learning from small data sets: Patch-based regularizers in inverse problems for image reconstruction. CoRR abs/2312.16611 (2023) - 2022
- [c13]Timo Kreimeier, Martina Kuchlbauer, Frauke Liers, Michael Stingl, Andrea Walther:
Towards the Solution of Robust Gas Network Optimization Problems Using the Constrained Active Signature Method. INOC 2022: 1-6 - 2021
- [i6]Jannis Bulling, Benjamin Jurgelucks, Jens Prager, Andrea Walther:
Defect reconstruction in a 2D semi-analytical waveguide model via derivative-based optimization. CoRR abs/2108.00770 (2021) - 2020
- [j36]Andreas Griewank, Andrea Walther:
Polyhedral DC Decomposition and DCA Optimization of Piecewise Linear Functions. Algorithms 13(7): 166 (2020) - [j35]Assefaw H. Gebremedhin, Andrea Walther:
An introduction to algorithmic differentiation. WIREs Data Mining Knowl. Discov. 10(1) (2020) - [c12]Arne Bockhorn, Sri Hari Krishna Narayanan, Andrea Walther:
Checkpointing Approaches for the Computation of Adjoints Covering Resilience Issues. CSC 2020: 22-31
2010 – 2019
- 2019
- [j34]Sabrina Fiege, Andrea Walther, Andreas Griewank:
An algorithm for nonsmooth optimization by successive piecewise linearization. Math. Program. 177(1-2): 343-370 (2019) - [j33]Andreas Griewank, Andrea Walther:
Finite convergence of an active signature method to local minima of piecewise linear functions. Optim. Methods Softw. 34(5): 1035-1055 (2019) - [j32]Andreas Griewank, Andrea Walther:
Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization. SIAM J. Optim. 29(1): 262-289 (2019) - [j31]Andrea Walther, Andreas Griewank:
Characterizing and Testing Subdifferential Regularity in Piecewise Smooth Optimization. SIAM J. Optim. 29(2): 1473-1501 (2019) - 2018
- [j30]Lisa Kusch, Tim Albring, Andrea Walther, Nicolas R. Gauger:
A one-shot optimization framework with additional equality constraints applied to multi-objective aerodynamic shape optimization. Optim. Methods Softw. 33(4-6): 694-707 (2018) - [j29]Mladen Banovic, Orest Mykhaskiv, Salvatore Auriemma, Andrea Walther, Herve Legrand, Jens-Dominik Müller:
Algorithmic differentiation of the Open CASCADE Technology CAD kernel and its coupling with an adjoint CFD solver. Optim. Methods Softw. 33(4-6): 813-828 (2018) - [j28]Benjamin Jurgelucks, Leander Claes, Andrea Walther, Bernd Henning:
Optimization of triple-ring electrodes on piezoceramic transducers using algorithmic differentiation. Optim. Methods Softw. 33(4-6): 868-888 (2018) - [j27]Sabrina Fiege, Andrea Walther, Kshitij Kulshreshtha, Andreas Griewank:
Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization. Optim. Methods Softw. 33(4-6): 1073-1088 (2018) - [j26]Stephan Schmidt, Maria Schutte, Andrea Walther:
Efficient Numerical Solution of Geometric Inverse Problems Involving Maxwell's Equations Using Shape Derivatives and Automatic Code Generation. SIAM J. Sci. Comput. 40(2) (2018) - [i5]Navjot Kukreja, Jan Hückelheim, Michael Lange, Mathias Louboutin, Andrea Walther, Simon W. Funke, Gerard Gorman:
High-level python abstractions for optimal checkpointing in inversion problems. CoRR abs/1802.02474 (2018) - [i4]Andreas Griewank, Andrea Walther, Koichi Kubota, Siegfried M. Rump:
Piecewise smooth system and optimization with piecewise linearization via algorithmic differentiation (NII Shonan Meeting 2018-9). NII Shonan Meet. Rep. 2018 (2018) - 2017
- [c11]Willi Braun, Kshitij Kulshreshtha, Rüdiger Franke, Andrea Walther, Bernhard Bachmann:
Towards Adjoint and Directional Derivatives in FMI utilizing ADOL-C within OpenModelica. Modelica 2017: 132:040 - [i3]Drosos Kourounis, Leonidas Gergidis, Michael A. Saunders, Andrea Walther, Olaf Schenk:
Compile-Time Symbolic Differentiation Using C++ Expression Templates. CoRR abs/1705.01729 (2017) - 2016
- [j25]Andrea Walther, Lorenz T. Biegler:
On an inexact trust-region SQP-filter method for constrained nonlinear optimization. Comput. Optim. Appl. 63(3): 613-638 (2016) - [j24]Andreas Griewank, Andrea Walther, Sabrina Fiege, Torsten Bosse:
On Lipschitz optimization based on gray-box piecewise linearization. Math. Program. 158(1-2): 383-415 (2016) - [j23]Andrea Walther, Nicolas R. Gauger, Lisa Kusch, Natalie Richert:
On an extension of one-shot methods to incorporate additional constraints. Optim. Methods Softw. 31(3): 494-510 (2016) - [j22]Andreas Griewank, Andrea Walther:
First- and second-order optimality conditions for piecewise smooth objective functions. Optim. Methods Softw. 31(5): 904-930 (2016) - 2014
- [c10]Kim Feldhoff, Martin Flehmig, Ulf Markwardt, Wolfgang E. Nagel, Maria Schutte, Andrea Walther:
SCADOPT: An Open-Source HPC Framework for Solving PDE Constrained Optimization Problems Using AD. HPCC/CSS/ICESS 2014: 46-53 - 2013
- [c9]Jamel Nebhen, Eric Savary, Wenceslas Rahajandraibe, Christian Dufaza, Stéphane Meillére, Fayrouz Haddad, Edith Kussener, Hervé Barthélemy, Jaroslaw Czarny, Andrea Walther:
Low-noise CMOS analog-to-digital interface for MEMS resistive microphone. ICECS 2013: 445-448 - 2012
- [j21]Andreas Griewank, Kshitij Kulshreshtha, Andrea Walther:
On the numerical stability of algorithmic differentiation. Computing 94(2-4): 125-149 (2012) - [j20]Bruce Christianson, Uwe Naumann, Jean Utke, Andrea Walther:
Preface. Optim. Methods Softw. 27(2): 175 (2012) - [j19]Andrea Walther, Sree Rama Raju Vetukuri, Lorenz T. Biegler:
A first-order convergence analysis of trust-region methods with inexact Jacobians and inequality constraints. Optim. Methods Softw. 27(2): 373-389 (2012) - [c8]Tobias Steinle, Jadran Vrabec, Andrea Walther:
Numerical Simulation of the Damping Behavior of Particle-Filled Hollow Spheres. HPSC 2012: 233-243 - [p1]Denise Holfeld, Philipp Stumm, Andrea Walther:
Structure Exploiting Adjoints for Finite Element Discretizations. Constrained Optimization and Optimal Control for Partial Differential Equations 2012: 183-196 - 2011
- [j18]Andrea Walther, Lorenz T. Biegler:
Numerical experiments with an inexact Jacobian trust-region algorithm. Comput. Optim. Appl. 48(2): 255-271 (2011) - 2010
- [j17]Mathias Wagner, Andrea Walther, Bernd-Jochen Schaefer:
On the efficient computation of high-order derivatives for implicitly defined functions. Comput. Phys. Commun. 181(4): 756-764 (2010) - [j16]Sebastian Schlenkrich, Andreas Griewank, Andrea Walther:
On the local convergence of adjoint Broyden methods. Math. Program. 121(2): 221-247 (2010) - [j15]Moritz Diehl, Andrea Walther, Hans Georg Bock, Ekaterina A. Kostina:
An adjoint-based SQP algorithm with quasi-Newton Jacobian updates for inequality constrained optimization. Optim. Methods Softw. 25(4): 531-552 (2010) - [j14]Philipp Stumm, Andrea Walther:
New Algorithms for Optimal Online Checkpointing. SIAM J. Sci. Comput. 32(2): 836-854 (2010)
2000 – 2009
- 2009
- [j13]Assefaw Hadish Gebremedhin, Arijit Tarafdar, Alex Pothen, Andrea Walther:
Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation. INFORMS J. Comput. 21(2): 209-223 (2009) - [j12]Philipp Stumm, Andrea Walther:
MultiStage Approaches for Optimal Offline Checkpointing. SIAM J. Sci. Comput. 31(3): 1946-1967 (2009) - [i2]Andrea Walther:
Getting Started with ADOL-C. Combinatorial Scientific Computing 2009 - 2008
- [b2]Andreas Griewank, Andrea Walther:
Evaluating derivatives - principles and techniques of algorithmic differentiation, Second Edition. SIAM 2008, ISBN 978-0-89871-659-7, pp. I-XXI, 1-438 - [j11]Andreas Griewank, Sebastian Schlenkrich, Andrea Walther:
Optimal r-order of an adjoint Broyden method without the assumption of linearly independent steps. Optim. Methods Softw. 23(2): 215-225 (2008) - [j10]Andrea Walther:
A First-Order Convergence Analysis of Trust-Region Methods with Inexact Jacobians. SIAM J. Optim. 19(1): 307-325 (2008) - [j9]Andrea Walther:
Computing sparse Hessians with automatic differentiation. ACM Trans. Math. Softw. 34(1): 3:1-3:15 (2008) - [c7]Andreas Kowarz, Andrea Walther:
Parallel Derivative Computation using ADOL-C. PASA 2008: 83-92 - 2007
- [j8]Andrea Walther:
Automatic differentiation of explicit Runge-Kutta methods for optimal control. Comput. Optim. Appl. 36(1): 83-108 (2007) - [j7]Antje Noack, Andrea Walther:
Adjoint concepts for the optimal control of Burgers equation. Comput. Optim. Appl. 36(1): 109-133 (2007) - [j6]Andreas Griewank, Andrea Walther, Maciek Korzec:
Maintaining factorized KKT systems subject to rank-one updates of Hessians and Jacobians. Optim. Methods Softw. 22(2): 279-295 (2007) - 2006
- [c6]Vincent Heuveline, Andrea Walther:
Online Checkpointing for Parallel Adjoint Computation in PDEs: Application to Goal-Oriented Adaptivity and Flow Control. Euro-Par 2006: 689-699 - [c5]Sebastian Schlenkrich, Andrea Walther, Nicolas R. Gauger, Ralf Heinrich:
Differentiating Fixed Point Iterations with ADOL-C: Gradient Calculation for Fluid Dynamics. HPSC 2006: 499-508 - [c4]Andreas Kowarz, Andrea Walther:
Optimal Checkpointing for Time-Stepping Procedures in ADOL-C. International Conference on Computational Science (4) 2006: 541-549 - 2004
- [j5]Andrea Walther:
Program reversals for evolutions with non-uniform step costs. Acta Informatica 40(4): 235-263 (2004) - [j4]Andrea Walther:
Bounding the Number of Processors and Checkpoints Needed in Time-minimal Parallel Reversal Schedules. Computing 73(2): 135-154 (2004) - [c3]Andreas Griewank, Andrea Walther:
On the Efficient Generation of Taylor Expansions for DAE Solutions by Automatic Differentiation. PARA 2004: 1089-1098 - 2003
- [i1]Uwe Naumann, Andrea Walther:
An Introduction to Using Software Tools for Automatic Differentiation. CoRR cs.MS/0310057 (2003) - 2002
- [j3]Andreas Griewank, Andrea Walther:
On constrained optimization by adjoint based quasi-Newton methods. Optim. Methods Softw. 17(5): 869-889 (2002) - [c2]Uwe Lehmann, Andrea Walther:
The Implementation and Testing of Time-Minimal and Resource-Optimal Parallel Reversal Schedules. International Conference on Computational Science (2) 2002: 1049-1058 - 2001
- [c1]Andrea Walther, Uwe Lehmann:
Adjoint Calculation Using Time-Minimal Program Reversals for Multi-Processor Machines. System Modelling and Optimization 2001: 317-331 - 2000
- [j2]Andreas Griewank, Jean Utke, Andrea Walther:
Evaluating higher derivative tensors by forward propagation of univariate Taylor series. Math. Comput. 69(231): 1117-1130 (2000) - [j1]Andreas Griewank, Andrea Walther:
Algorithm 799: revolve: an implementation of checkpointing for the reverse or adjoint mode of computational differentiation. ACM Trans. Math. Softw. 26(1): 19-45 (2000)
1990 – 1999
- 1999
- [b1]Andrea Walther:
Program reversal schedules for single and multi-processor machines. Dresden University of Technology, Germany, 1999, pp. 1-155
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-04-24 23:08 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:
