Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Cooling schedules for optimal annealing
Mathematics of Operations Research
Simulated annealing: theory and applications
Simulated annealing: theory and applications
Comparison of Single- and Dual-Pass Multiply-Add Fused Floating-Point Units
IEEE Transactions on Computers
Evaluating derivatives: principles and techniques of algorithmic differentiation
Evaluating derivatives: principles and techniques of algorithmic differentiation
Automatic differentiation of algorithms: from simulation to optimization
Automatic differentiation of algorithms: from simulation to optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Cheaper Jacobians by Simulated Annealing
SIAM Journal on Optimization
Adifor 2.0: Automatic Differentiation of Fortran 77 Programs
IEEE Computational Science & Engineering
Markowitz-type heuristics for computing Jacobian matrices efficiently
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
| Hi-index | 0.00 |
We present new ideas on how to make simulated annealing applicable to the combinatorial optimization problem of accumulating a Jacobian matrix of a given vector function using the minimal number of arithmetic operations. Building on vertex elimination in computational graphs we describe how simulated annealing can be used to find good approximations to the solution of this problem at a reasonable cost.