Using Expression Graphs in Optimization Algorithms

DOI10.1007/978-1-4614-1927-3_8zbMath1242.90131OpenAlexW4234879673MaRDI QIDQ2897299

David M. Gay

Publication date: 10 July 2012

Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)

Full work available at URL: https://www.osti.gov/biblio/1141882

zbMATH Keywords

automatic differentiationconstraint propagationpresolvebound computationexpression graphs

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Mixed integer programming (90C11) Graph theory (including graph drawing) in computer science (68R10) Theory of compilers and interpreters (68N20) Graph algorithms (graph-theoretic aspects) (05C85) General topics in computing methodologies (68U01)

Related Items (2)

The \textsc{deal.II} finite element library: design, features, and insights ⋮ Maximizing the storage capacity of gas networks: a global MINLP approach

Uses Software

• ADOL-C
• AMPL
• Autodiff
• DrAmpl
• Sacado
• GlobSol
• Cosy

This page was built for publication: Using Expression Graphs in Optimization Algorithms