Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment
From MaRDI portal
Publication:2899035
DOI10.1287/ijoc.1090.0321zbMath1243.90004OpenAlexW2151460223MaRDI QIDQ2899035
Chandrakant Maheshwari, Dominique Orban, Arnold Neumaier, Robert Fourer, Hermann Schichl
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1090.0321
constrained optimizationdirected acyclic graph\texttt{COCONUT}\texttt{Dr. Ampl}convexity disprovingconvexity proving
Programming involving graphs or networks (90C35) Symbolic computation and algebraic computation (68W30) Nonlinear programming (90C30) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
A hybrid LP/NLP paradigm for global optimization relaxations, DrAmpl: A meta solver for optimization problem analysis, SUSPECT: MINLP special structure detector for Pyomo, On the complexity of detecting convexity over a box, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests, A polyhedral branch-and-cut approach to global optimization, The Conjugate Residual Method in Linesearch and Trust-Region Methods
Uses Software
