SUSPECT: MINLP special structure detector for Pyomo
From MaRDI portal
Publication:2182769
DOI10.1007/s11590-019-01396-yzbMath1444.90081OpenAlexW2916638179WikidataQ128387879 ScholiaQ128387879MaRDI QIDQ2182769
Francesco Ceccon, Ruth Misener, John D. Siirola
Publication date: 26 May 2020
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01396-y
Mixed integer programming (90C11) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, The supporting hyperplane optimization toolkit for convex MINLP, SUSPECT
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- GLOMIQO: global mixed-integer quadratic optimizer
- A framework for globally optimizing mixed-integer signomial programs
- Three enhancements for optimization-based bound tightening
- DrAmpl: A meta solver for optimization problem analysis
- Integrated methods for optimization
- Interval analysis on directed acyclic graphs for global optimization
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- Applications of second-order cone programming
- A polyhedral branch-and-cut approach to global optimization
- Difference of convex solution of quadratically constrained optimization problems.
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Analyzing the computational impact of MIQCP solver components
- A branch-and-cut method for 0-1 mixed convex programming
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- OSiL: An instance language for optimization
- Bound reduction using pairs of linear inequalities
- Global optimization in engineering design
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment
- Graph Implementations for Nonsmooth Convex Programs
- Feasibility-Based Bounds Tightening via Fixed Points
- Branching and bounds tighteningtechniques for non-convex MINLP
- Efficient Calculation of Bounds on Spectra of Hessian Matrices
- Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests
- Introduction to Interval Analysis
- Applying interval arithmetic to real, integer, and boolean constraints
- Mixed-integer nonlinear optimization
- Global Optimization and Constraint Satisfaction
- Pyomo -- optimization modeling in Python
- Analyzing mathematical programs using MProbe
