Pages that link to "Item:Q1361080"
From MaRDI portal
The following pages link to A convex envelope formula for multilinear functions (Q1361080):
Displaying 31 items.
- Multivariate McCormick relaxations (Q2250101) (← links)
- Outer approximation algorithms for canonical DC problems (Q2269586) (← links)
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation (Q2274853) (← links)
- Convex envelope of bivariate cubic functions over rectangular regions (Q2301177) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- Global optimization of nonconvex problems with multilinear intermediates (Q2356333) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
- Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program (Q2450669) (← links)
- On convex envelopes for bivariate functions over polytopes (Q2452372) (← links)
- Perspective cuts for a class of convex 0-1 mixed integer programs (Q2490334) (← links)
- Piecewise polyhedral formulations for a multilinear term (Q2661606) (← links)
- On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations (Q2694515) (← links)
- (Q2861492) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Alternative branching rules for some nonconvex problems (Q2943824) (← links)
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex (Q2954391) (← links)
- The Multilinear Polytope for Acyclic Hypergraphs (Q4637506) (← links)
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
- Fortification Against Cascade Propagation Under Uncertainty (Q5084610) (← links)
- Tractable Relaxations of Composite Functions (Q5085133) (← links)
- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives (Q5085488) (← links)
- The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
- On the Composition of Convex Envelopes for Quadrilinear Terms (Q5244679) (← links)
- Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis (Q5870347) (← links)
- Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- A new technique to derive tight convex underestimators (sometimes envelopes) (Q6155069) (← links)
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps (Q6173797) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023 (Q6544493) (← links)
- MIP relaxations in factorable programming (Q6601201) (← links)
