Randomized heuristics for exploiting Jacobian scarcity

DOI10.1080/10556788.2011.577774zbMath1242.90301OpenAlexW1981804779MaRDI QIDQ2885477

Andrew Lyons, Jean Utke, Ilya Safro

Publication date: 23 May 2012

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2086/

zbMATH Keywords

automatic differentiationedge eliminationscarcitypreaccumulation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Theory of compilers and interpreters (68N20) Randomized algorithms (68W20) Random walks on graphs (05C81)

Uses Software

• OpenAD/F

Cites Work

• Optimization by Simulated Annealing
• Complexity of the minimum-dummy-activities problem in a pert network
• OpenAD/F
• A mathematical view of automatic differentiation
• Unnamed Item

This page was built for publication: Randomized heuristics for exploiting Jacobian scarcity