Relaxation via separable estimators: arithmetic and implementation
From MaRDI portal
Cites work
- A convex envelope formula for multilinear functions
- A general framework for convexity analysis in deterministic global optimization
- A polyhedral branch-and-cut approach to global optimization
- A reduced space branch and bound algorithm for global optimization.
- A review of benchmark and test functions for global optimization algorithms and metaheuristics
- Bounding the Solutions of Parameter Dependent Nonlinear Ordinary Differential Equations
- Branching and bounds tighteningtechniques for non-convex MINLP
- Chebyshev model arithmetic for factorable functions
- Comparison of MINLP formulations for global superstructure optimization
- Complete search in continuous global optimization and constraint satisfaction
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computing numerically with functions instead of numbers
- Convergence analysis of Taylor models and McCormick-Taylor models
- Convergence rate of McCormick relaxations
- Convex and concave relaxations of implicit functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Convexity and concavity detection in computational graphs: tree walks for convexity assessment
- DC programming: overview.
- Deterministic global optimization with artificial neural networks embedded
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- EAGO.jl: easy advanced global optimization in Julia
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Global optimization of nonconvex problems with multilinear intermediates
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3936378 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Interval analysis: Theory and applications
- McCormick-Based Relaxations of Algorithms
- Multivariate McCormick relaxations
- On functions representable as a difference of convex functions
- Optimal reconstruction of a function from its projections
- Reachability analysis and deterministic global optimization of DAE models
- Reduced RLT representations for nonconvex polynomial programming problems
- Ridge functions
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Semidefinite programming relaxations for semialgebraic problems
- The cluster problem in multivariate global optimization
- The cluster problem revisited
- The convergence rate of the sandwich algorithm for approximating convex functions
- Three enhancements for optimization-based bound tightening
- Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs
This page was built for publication: Relaxation via separable estimators: arithmetic and implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411485)
