Using expression graphs in optimization algorithms

DOI10.1007/978-1-4614-1927-3_8zbMATH Open1242.90131OpenAlexW4234879673MaRDI QIDQ2897299FDOQ2897299

Authors: 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

Recommendations

• Revisiting expression representations for nonlinear AMPL models
• The AMPL modeling language: an aid to formulating and solving optimization problems
• A Modeling Language for Mathematical Programming
• scientific article; zbMATH DE number 140017
• scientific article; zbMATH DE number 1114457

zbMATH Keywords

constraint propagationautomatic differentiationpresolvebound computationexpression graphs

Mathematics Subject Classification ID

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

Cited In (3)

• Revisiting expression representations for nonlinear AMPL models
• 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

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