Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes

From MaRDI portal
Revision as of 12:06, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1888142

DOI10.1023/B:JOGO.0000042112.72379.E6zbMath1085.90047MaRDI QIDQ1888142

Clifford A. Meyer, Christodoulos A. Floudas

Publication date: 22 November 2004

Published in: Journal of Global Optimization (Search for Journal in Brave)




Related Items (51)

A review of recent advances in global optimizationNon polyhedral convex envelopes for 1-convex functionsGlobal optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFODeriving convex hulls through lifting and projectionOn linear programming relaxations for solving polynomial programming problemsConvex relaxation for solving posynomial programsGLOMIQO: global mixed-integer quadratic optimizerAn edge-concave underestimator for the global optimization of twice-differentiable nonconvex problemsTractable Relaxations of Composite FunctionsConvexifications of rank-one-based substructures in QCQPs and applications to the pooling problemGlobal optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxationsError bounds for monomial convexification in polynomial optimizationA framework for globally optimizing mixed-integer signomial programsSimultaneous Convexification of Bilinear Functions over Polytopes with Application to Network InterdictionConvex quadratic relaxations for mixed-integer nonlinear programs in power systemsMulti-parametric disaggregation technique for global optimization of polynomial programming problemsOn the impact of running intersection inequalities for globally solving polynomial optimization problemsConvex envelopes generated from finitely many compact convex setsConvex envelopes of products of convex and component-wise concave functionsA review of deterministic optimization methods in engineering and managementOn convex relaxations of quadrilinear termsThe Convex Hull of a Quadratic Constraint over a PolytopeRelaxations of factorable functions with convex-transformable intermediatesConvex underestimation for posynomial functions of positive variablesExistence and sum decomposition of vertex polyhedral convex envelopesA new framework to relax composite functions in nonlinear programsA new global optimization method for univariate constrained twice-differentiable NLP problemsComplete mixed integer linear programming formulations for modularity density based clusteringANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equationsMultivariate McCormick relaxationsGlobal optimization of general nonconvex problems with intermediate polynomial substructuresNew multi-commodity flow formulations for the pooling problemOn branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxationGlobal optimization of nonconvex problems with convex-transformable intermediatesPiecewise-linear approximations of multidimensional functionsSharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systemsExperimental validation of volume-based comparison for double-McCormick relaxationsUnnamed ItemGlobal optimization of general non-convex problems with intermediate bilinear substructuresTrigonometric convex underestimator for the base functions in Fourier spaceConvex envelopes for edge-concave functionsDistributionally robust facility location problem under decision-dependent stochastic demandPerformance of convex underestimators in a branch-and-bound frameworkReformulations in Mathematical Programming: Definitions and SystematicsTight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functionsTight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functionsComputing the volume of the convex hull of the graph of a trilinear monomial using mixed volumesConvex envelopes for ray-concave functionsOn the Composition of Convex Envelopes for Quadrilinear TermsGlobal optimization of nonconvex problems with multilinear intermediatesMixed-integer linear methods for layout-optimization of screening systems in recovered paper production







This page was built for publication: Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes