Analysis of bounds for multilinear functions
From MaRDI portal
Publication:5942316
DOI10.1023/A:1011295715398zbMath0982.90054MaRDI QIDQ5942316
Hong Seo Ryoo, Nikolaos V. Sahinidis
Publication date: 28 August 2001
Published in: Journal of Global Optimization (Search for Journal in Brave)
arithmetic interval methodbounding of multilinear functionsbounding schemesconcave envelopeconvex envelopeexponent transformation methodlogarithmic transformation methodmultiplicative programsnonconvex optimization problems
Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31)
Related Items
Graph, clique and facet of Boolean logical polytope, A review of recent advances in global optimization, Non polyhedral convex envelopes for 1-convex functions, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Data separation via a finite number of discriminant functions: a global optimization approach, Solving generalized polynomial problem by using new affine relaxed technique, On linear programming relaxations for solving polynomial programming problems, Convex relaxation for solving posynomial programs, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, Strong valid inequalities for Boolean logical pattern generation, Some results on the strength of relaxations of multilinear functions, Error bounds for monomial convexification in polynomial optimization, On the impact of running intersection inequalities for globally solving polynomial optimization problems, On the strength of recursive McCormick relaxations for binary polynomial optimization, A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps, On duality for a class of quasiconcave multiplicative programs, Explicit convex and concave envelopes through polyhedral subdivisions, A review of deterministic optimization methods in engineering and management, On convex relaxations of quadrilinear terms, The Convex Hull of a Quadratic Constraint over a Polytope, Convergence rate of McCormick relaxations, On convex envelopes for bivariate functions over polytopes, Relaxations of factorable functions with convex-transformable intermediates, A convex analysis approach for convex multiplicative programming, The Multilinear Polytope for Acyclic Hypergraphs, Convex underestimation for posynomial functions of positive variables, Existence and sum decomposition of vertex polyhedral convex envelopes, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, A class of valid inequalities for multilinear 0-1 optimization problems, Designing globally optimal delta-sigma modulator topologies via signomial programming, A technique to derive the analytical form of convex envelopes for some bivariate functions, Convex envelopes of bivariate functions through the solution of KKT systems, An outcome space approach for generalized convex multiplicative programs, Piecewise-linear approximations of multidimensional functions, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation, \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation, Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions, Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions, Convex envelopes for ray-concave functions, Global optimization of nonconvex problems with multilinear intermediates
