Andreas Griewank

According to our database1, Andreas Griewank authored at least 55 papers between 1984 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Polyhedral DC Decomposition and DCA Optimization of Piecewise Linear Functions.
Algorithms, 2020

2019
Characterizing and Testing Subdifferential Regularity in Piecewise Smooth Optimization.
SIAM J. Optim., 2019

Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization.
SIAM J. Optim., 2019

Finite convergence of an active signature method to local minima of piecewise linear functions.
Optim. Methods Softw., 2019

An algorithm for nonsmooth optimization by successive piecewise linearization.
Math. Program., 2019

Treating Artificial Neural Net Training as a Nonsmooth Global Optimization Problem.
Proceedings of the Machine Learning, Optimization, and Data Science, 2019

2018
Piecewise linear secant approximation via algorithmic piecewise differentiation.
Optim. Methods Softw., 2018

Integrating Lipschitzian dynamical systems using piecewise algorithmic differentiation.
Optim. Methods Softw., 2018

Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization.
Optim. Methods Softw., 2018

Preface.
Optim. Methods Softw., 2018

High dimensional integration of kinks and jumps - Smoothing by preintegration.
J. Comput. Appl. Math., 2018

2016
First- and second-order optimality conditions for piecewise smooth objective functions.
Optim. Methods Softw., 2016

On Lipschitz optimization based on gray-box piecewise linearization.
Math. Program., 2016

2015
Obituary for Mike Powell.
Optim. Methods Softw., 2015

2014
Cubic overestimation and secant updating for unconstrained optimization of <i>C</i><sup>2, 1</sup> functions.
Optim. Methods Softw., 2014

Automatic evaluations of cross-derivatives.
Math. Comput., 2014

Quasi-Monte Carlo methods for lattice systems: A first look.
Comput. Phys. Commun., 2014

Adaptive sequencing of primal, dual, and design steps in simulation based optimization.
Comput. Optim. Appl., 2014

2013
On stable piecewise linearization and generalized algorithmic differentiation.
Optim. Methods Softw., 2013

Representation and Analysis of Piecewise Linear Functions in Abs-Normal Form.
Proceedings of the System Modeling and Optimization, 2013

From the Product Example to PDE Adjoints, Algorithmic Differentiation and Its Application (Invited Talk).
Proceedings of the Computer Algebra in Scientific Computing - 15th International Workshop, 2013

2012
Parametric approach to optimal control.
Optim. Lett., 2012

On the numerical stability of algorithmic differentiation.
Computing, 2012

Automated Extension of Fixed Point PDE Solvers for Optimal Design with Bounded Retardation.
Proceedings of the Constrained Optimization and Optimal Control for Partial Differential Equations, 2012

2011
Obituary for Charles Broyden.
Optim. Methods Softw., 2011

A continuous framework for open pit mine planning.
Math. Methods Oper. Res., 2011

Reduced quasi-Newton method for simultaneous design and optimization.
Comput. Optim. Appl., 2011

2010
Properties of an augmented Lagrangian for design optimization.
Optim. Methods Softw., 2010

On the local convergence of adjoint Broyden methods.
Math. Program., 2010

2009
Complexity of Gradients, Jacobians, and Hessians.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Algorithmic Differentiation Through Automatic Graph Elimination Ordering (ADTAGEO).
Proceedings of the Combinatorial Scientific Computing, 01.02. - 06.02.2009, 2009

2008
Optimal <i>r</i>-order of an adjoint Broyden method without the assumption of linearly independent steps.
Optim. Methods Softw., 2008

Evaluating derivatives - principles and techniques of algorithmic differentiation, Second Edition.
SIAM, ISBN: 978-0-89871-659-7, 2008

2007
Maintaining factorized KKT systems subject to rank-one updates of Hessians and Jacobians.
Optim. Methods Softw., 2007

2005
Yury G. Evtushenko - a tribute.
Optim. Methods Softw., 2005

2004
On the Efficient Generation of Taylor Expansions for DAE Solutions by Automatic Differentiation.
Proceedings of the Applied Parallel Computing, 2004

2003
Accumulating Jacobians as chained sparse matrix products.
Math. Program., 2003

Analysis and Exploitation of Jacobian Scarcity.
Proceedings of the Modeling, 2003

2002
On constrained optimization by adjoint based quasi-Newton methods.
Optim. Methods Softw., 2002

Reduced Functions, Gradients and Hessians from Fixed-Point Iterations for State Equations.
Numer. Algorithms, 2002

Detecting Jacobian sparsity patterns by Bayesian probing.
Math. Program., 2002

2000
Algorithm 799: revolve: an implementation of checkpointing for the reverse or adjoint mode of computational differentiation.
ACM Trans. Math. Softw., 2000

Evaluating higher derivative tensors by forward propagation of univariate Taylor series.
Math. Comput., 2000

Evaluating derivatives - principles and techniques of algorithmic differentiation.
Frontiers in applied mathematics 19, SIAM, ISBN: 978-0-89871-451-7, 2000

1998
Circumventing Storage Limitations in Variational Data Assimilation Studies.
SIAM J. Sci. Comput., 1998

1996
Algorithm 755: ADOL-C: A Package for the Automatic Differentiation of Algorithms Written in C/C++.
ACM Trans. Math. Softw., 1996

High-Order Stiff ODE Solvers via Automatic Differentiation and Rational Prediction.
Proceedings of the Numerical Analysis and Its Applications, First International Workshop, 1996

1994
Computing Large Sparse Jacobian Matrices Using Automatic Differentiation.
SIAM J. Sci. Comput., 1994

Numerical Optimization At the Center for Research On Parallel Computation.
Int. J. High Perform. Comput. Appl., 1994

1992
ADIFOR - Generating Derivative Codes form Fortran Programs.
Sci. Program., 1992

ADIFOR: Automatic Differentiation in a Source Translator Environment.
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

1991
The equivalence of strict convexity and injectivity of the gradient in bounded level sets.
Math. Program., 1991

The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients.
Math. Program., 1991

Exploiting parallelism in automatic differentiation.
Proceedings of the 5th international conference on Supercomputing, 1991

1984
On the existence of convex decompositions of partially separable functions.
Math. Program., 1984


  Loading...