Minotaur: a mixed-integer nonlinear optimization toolkit
From MaRDI portal
Recommendations
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Mixed-integer nonlinear optimization
- An algorithmic framework for convex mixed integer nonlinear programs
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Algorithms, softwares and recent developments of mixed integer nonlinear programming
Cites work
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- A Modeling Language for Mathematical Programming
- A note on performance profiles for benchmarking software
- A tree-search algorithm for mixed integer programming problems
- An algorithmic framework for convex mixed integer nonlinear programs
- An Automatic Method of Solving Discrete Programming Problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Approximated perspective relaxations: a project and lift approach
- Automatic Hessians by reverse accumulation
- BARON: A general purpose global optimization software package
- Benchmarking optimization software with performance profiles.
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Branching rules revisited
- Complete search in continuous global optimization and constraint satisfaction
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Deterministic global optimization. Theory, methods and applications
- Efficient computation of sparse hessians using coloring and automatic differentiation
- Evaluating Derivatives
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Generalized Benders decomposition
- Global optimization with polynomials and the problem of moments
- GLOMIQO: global mixed-integer quadratic optimizer
- scientific article; zbMATH DE number 992821 (Why is no real title available?)
- scientific article; zbMATH DE number 3637601 (Why is no real title available?)
- scientific article; zbMATH DE number 1101647 (Why is no real title available?)
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Mixed integer nonlinear programming using interior-point methods
- Mixed integer second order cone programming.
- Mixed-integer nonlinear optimization
- Nonlinear programming without a penalty function.
- Numerical Optimization
- Numerical Software with Result Verification
- On branching rules for convex mixed-integer nonlinear optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulation and applications
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- qpOASES: a parametric active-set algorithm for~quadratic programming
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- SCIP: solving constraint integer programs
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Solving mixed integer nonlinear programs by outer approximation
- Subgradient based outer approximation for mixed integer second order cone programming
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
Cited in
(28)- Juniper: an open-source nonlinear branch-and-bound solver in Julia
- MINOTAUR
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- The supporting hyperplane optimization toolkit for convex MINLP
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- SUSPECT: MINLP special structure detector for Pyomo
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems
- A primal heuristic for optimizing the topology of gas networks based on dual information
- Strengthening the sequential convex MINLP technique by perspective reformulations
- An optimisation approach to constructing an exchange-traded fund
- Optimization as an analysis tool for human complex problem solving
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- A mixed-integer PDE-constrained optimization formulation for electromagnetic cloaking
- MinT: A Database for Optimal Net Parameters
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- Modeling design and control problems involving neural network surrogates
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
- Supermodularity and valid inequalities for quadratic optimization with indicators
- Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- MIP relaxations in factorable programming
- Solving continuous and discrete nonlinear programs with BARON
- A combined linear and nonlinear presolve for nonlinear optimization
- Convex mixed-integer optimization with Frank-Wolfe methods
- 50 years of mixed-integer nonlinear and disjunctive programming
Describes a project that uses
Uses Software
This page was built for publication: Minotaur: a mixed-integer nonlinear optimization toolkit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q823885)
