Superposition relaxation creates separable estimators for factorable functions that are tighter than McCormick relaxations in numerical tests while providing convergence guarantees.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4representative citing papers
New nonlinear formulations for geometric packing problems, solved with FICO Xpress and SCIP, produce improved and first-known solutions for several variants.
A complete linear inequality description and volume formula are derived for the convex hull of the graph of a monomial on a nonnegative box with at most one positive lower bound.
PALM-Mean combines sign-aware piecewise-linear relaxations of locally important kernel terms with closed-form analytic bounds on the rest inside a reduced-space branch-and-bound framework, yielding valid lower bounds and ε-global convergence for GP posterior mean optimization.
citing papers explorer
-
Relaxation via Separable Estimators: Arithmetic and Implementation
Superposition relaxation creates separable estimators for factorable functions that are tighter than McCormick relaxations in numerical tests while providing convergence guarantees.
-
Out-of-the-Box Global Optimization for Packing Problems: New Models and Improved Solutions
New nonlinear formulations for geometric packing problems, solved with FICO Xpress and SCIP, produce improved and first-known solutions for several variants.
-
On the convex hull of the graph of a simple monomial
A complete linear inequality description and volume formula are derived for the convex hull of the graph of a monomial on a nonnegative box with at most one positive lower bound.
-
An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions
PALM-Mean combines sign-aware piecewise-linear relaxations of locally important kernel terms with closed-form analytic bounds on the rest inside a reduced-space branch-and-bound framework, yielding valid lower bounds and ε-global convergence for GP posterior mean optimization.