Minotaur: a mixed-integer nonlinear optimization toolkit
From MaRDI portal
Publication:823885
DOI10.1007/s12532-020-00196-1zbMath1476.65099OpenAlexW3100769578MaRDI QIDQ823885
Sven Leyffer, Jeff Linderoth, Ashutosh Mahajan, James R. Luedtke, Todd S. Munson
Publication date: 16 December 2021
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-020-00196-1
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, The supporting hyperplane optimization toolkit for convex MINLP, SUSPECT: MINLP special structure detector for Pyomo, 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, Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation, 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, MINOTAUR, Strengthening the sequential convex MINLP technique by perspective reformulations, An optimisation approach to constructing an exchange-traded fund, A Mixed-Integer PDE-Constrained Optimization Formulation for Electromagnetic Cloaking, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Approximated perspective relaxations: a project and lift approach
- GLOMIQO: global mixed-integer quadratic optimizer
- qpOASES: a parametric active-set algorithm for~quadratic programming
- SCIP: solving constraint integer programs
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- An algorithmic framework for convex mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Branching rules revisited
- BARON: A general purpose global optimization software package
- Deterministic global optimization. Theory, methods and applications
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- 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
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Generalized Benders decomposition
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Global Optimization with Polynomials and the Problem of Moments
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming
- Perspective Reformulation and Applications
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
- Mixed integer nonlinear programming using interior-point methods
- An Automatic Method of Solving Discrete Programming Problems
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Evaluating Derivatives
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Automatic Hessians by reverse accumulation
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Numerical Optimization
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- On branching rules for convex mixed-integer nonlinear optimization
- A Note on Performance Profiles for Benchmarking Software
- Complete search in continuous global optimization and constraint satisfaction
- Numerical Software with Result Verification
- Mixed-integer nonlinear optimization
- A tree-search algorithm for mixed integer programming problems
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Benchmarking optimization software with performance profiles.
- Nonlinear programming without a penalty function.
