Cheaper Jacobians by Simulated Annealing

DOI10.1137/S1052623400368394MaRDI QIDQ4785901zbMATH OpenOpenAlexFDO

Authors Uwe Naumann

Publication date 5 January 2003

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623400368394

zbMATH Keywords

automatic differentiationsimulated annealing.vertex elimination

Mathematics Subject Classification ID

Implicit function theorems, Jacobians, transformations with several variables (26B10) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 2083806
• Accumulating Jacobians as chained sparse matrix products
• Randomized heuristics for exploiting Jacobian scarcity
• Stochastic Algorithms: Foundations and Applications
• scientific article; zbMATH DE number 1269473

Cited in

(7)

• Optimal Jacobian accumulation is NP-complete
• Randomized heuristics for exploiting Jacobian scarcity
• scientific article; zbMATH DE number 125119 (Why is no real title available?)
• scientific article; zbMATH DE number 1269473 (Why is no real title available?)
• scientific article; zbMATH DE number 2083806 (Why is no real title available?)
• Stochastic Algorithms: Foundations and Applications
• Optimality-preserving elimination of linearities in Jacobian accumulation

This page was built for publication: Cheaper Jacobians by Simulated Annealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785901)