Pages that link to "Item:Q5942316"
From MaRDI portal
The following pages link to Analysis of bounds for multilinear functions (Q5942316):
Displayed 42 items.
- Non polyhedral convex envelopes for 1-convex functions (Q312465) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Convergence rate of McCormick relaxations (Q656830) (← links)
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation (Q730482) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- A convex analysis approach for convex multiplicative programming (Q934807) (← links)
- Convex underestimation for posynomial functions of positive variables (Q941023) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
- Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions (Q1024827) (← links)
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions (Q1024828) (← links)
- On duality for a class of quasiconcave multiplicative programs (Q1411526) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems (Q1668794) (← links)
- Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- Convex envelopes of bivariate functions through the solution of KKT systems (Q1756774) (← links)
- Some results on the strength of relaxations of multilinear functions (Q1925788) (← links)
- Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
- A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
- On convex relaxations of quadrilinear terms (Q1959235) (← links)
- Convex envelopes for ray-concave functions (Q2080818) (← links)
- Graph, clique and facet of Boolean logical polytope (Q2124813) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- A technique to derive the analytical form of convex envelopes for some bivariate functions (Q2250092) (← 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)
- Global optimization of nonconvex problems with multilinear intermediates (Q2356333) (← links)
- Data separation via a finite number of discriminant functions: a global optimization approach (Q2383778) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
- On convex envelopes for bivariate functions over polytopes (Q2452372) (← links)
- Relaxations of factorable functions with convex-transformable intermediates (Q2452375) (← links)
- Convex relaxation for solving posynomial programs (Q2655346) (← links)
- Designing globally optimal delta-sigma modulator topologies via signomial programming (Q3018533) (← links)
- The Multilinear Polytope for Acyclic Hypergraphs (Q4637506) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
- On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903) (← links)
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps (Q6173797) (← links)