EAGO.jl: easy advanced global optimization in Julia
From MaRDI portal
Publication:5038425
DOI10.1080/10556788.2020.1786566zbMath1501.90077OpenAlexW3048483007WikidataQ121752461 ScholiaQ121752461MaRDI QIDQ5038425
Matthew D. Stuber, Matthew E. Wilhelm
Publication date: 30 September 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2020.1786566
Julianonconvex programmingbranch-and-bounddeterministic global optimizationMcCormick relaxationsoptimization software
Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34)
Related Items
EAGO.jl ⋮ Obey validity limits of data-driven models through topological data analysis and one-class classification ⋮ General convex relaxations of implicit functions and inverse functions ⋮ Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization ⋮ Improved convex and concave relaxations of composite bilinear forms ⋮ A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Reverse propagation of McCormick relaxations
- Differentiable McCormick relaxations
- Three enhancements for optimization-based bound tightening
- Convergence analysis of multivariate McCormick relaxations
- Constraint propagation on quadratic constraints
- Convergence rate of McCormick relaxations
- Generalized McCormick relaxations
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Computation and application of Taylor polynomials with interval remainder bounds
- Automatic differentiation of algorithms
- A hybrid LP/NLP paradigm for global optimization relaxations
- Juniper: an open-source nonlinear branch-and-bound solver in Julia
- The cluster problem in constrained global optimization
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
- Domain reduction techniques for global NLP and MINLP optimization
- Corrections to: ``Differentiable McCormick relaxations
- A polyhedral branch-and-cut approach to global optimization
- A comparison of complete global optimization solvers
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- BARON: A general purpose global optimization software package
- Tighter McCormick relaxations through subgradient propagation
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Multivariate McCormick relaxations
- On tightness and anchoring of McCormick and other relaxations
- Affine arithmetic: concepts and applications
- Erratum to: ``Multivariate McCormick relaxations
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Second-order sufficient optimality conditions for local and global nonlinear programming
- Convex and concave relaxations of implicit functions
- Julia: A Fresh Approach to Numerical Computing
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Branching and bounds tighteningtechniques for non-convex MINLP
- Evaluating Derivatives
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- McCormick-Based Relaxations of Algorithms
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Evolutionary Algorithms for Global Optimization
- JuMP: A Modeling Language for Mathematical Optimization
- Pyomo — Optimization Modeling in Python
- Benchmarking optimization software with performance profiles.
