SUSPECT: MINLP special structure detector for Pyomo
From MaRDI portal
Recommendations
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Convexity and concavity detection in computational graphs: tree walks for convexity assessment
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Mixed-integer nonlinear optimization
- The supporting hyperplane optimization toolkit for convex MINLP
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 4011808 (Why is no real title available?)
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 1101647 (Why is no real title available?)
- scientific article; zbMATH DE number 2068059 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A branch-and-cut method for 0-1 mixed convex programming
- A framework for globally optimizing mixed-integer signomial programs
- A polyhedral branch-and-cut approach to global optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Analyzing mathematical programs using MProbe
- Analyzing the computational impact of MIQCP solver components
- Applications of second-order cone programming
- Applying interval arithmetic to real, integer, and boolean constraints
- Bound reduction using pairs of linear inequalities
- Branching and bounds tighteningtechniques for non-convex MINLP
- CVXPY: a Python-embedded modeling language for convex optimization
- Convexity and concavity detection in computational graphs: tree walks for convexity assessment
- Difference of convex solution of quadratically constrained optimization problems.
- Disciplined convex programming
- DrAmpl: A meta solver for optimization problem analysis
- Efficient Calculation of Bounds on Spectra of Hessian Matrices
- Feasibility-based bounds tightening via fixed points
- GLOMIQO: global mixed-integer quadratic optimizer
- Global Optimization and Constraint Satisfaction
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Global optimization in engineering design
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Graph implementations for nonsmooth convex programs
- Integrated methods for optimization
- Interval analysis on directed acyclic graphs for global optimization
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- Introduction to Interval Analysis
- Introduction to algorithms.
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Mixed-integer nonlinear optimization
- OSiL: An instance language for optimization
- Pyomo -- optimization modeling in Python
- Supporting global numerical optimization of rational functions by generic symbolic convexity tests
- Three enhancements for optimization-based bound tightening
Cited in
(3)
Describes a project that uses
Uses Software
This page was built for publication: SUSPECT: MINLP special structure detector for Pyomo
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2182769)
