DrAmpl: A meta solver for optimization problem analysis
From MaRDI portal
Publication:601972
DOI10.1007/s10287-009-0101-zzbMath1243.90005OpenAlexW2069223201MaRDI QIDQ601972
Robert Fourer, Dominique Orban
Publication date: 29 October 2010
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-009-0101-z
directed acyclic graphoptimization modelAMPL modeling languageconvexity assessmentsolver recommendationstructural model analysis
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, Computing in Operations Research Using Julia, SUSPECT: MINLP special structure detector for Pyomo, Polyhedral approximation in mixed-integer convex optimization, DrAmpl
Uses Software
Cites Work
- Interval analysis on directed acyclic graphs for global optimization
- An SQP method for general nonlinear programs using only equality constrained subproblems
- An interior-point algorithm for nonconvex nonlinear programming
- Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment
- Computational Graphs and Rounding Error
- Solving the Trust-Region Subproblem using the Lanczos Method
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- On the Convergence of Successive Linear-Quadratic Programming Algorithms
- A trust region method based on interior point techniques for nonlinear programming.
- Analyzing mathematical programs using MProbe
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
