Convex envelopes of monomials of odd degree
From MaRDI portal
Publication:1411320
DOI10.1023/A:1021924706467zbMath1030.90117MaRDI QIDQ1411320
Constantinos C. Pantelides, Leo Liberti
Publication date: 27 October 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
Global optimization; linear relaxation; nonconvex functions; branch-and-bound methods; Convex relaxation
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C29: Multi-objective and goal programming
Related Items
SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, On the Composition of Convex Envelopes for Quadrilinear Terms, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, Temporal linear relaxation in IBM ILOG CP optimizer, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, A framework for globally optimizing mixed-integer signomial programs, Differentiable McCormick relaxations, Generalized McCormick relaxations, A review of recent advances in global optimization, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, Convex underestimation for posynomial functions of positive variables, Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions, Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Convergence-order analysis of branch-and-bound algorithms for constrained problems, A review of deterministic optimization methods in engineering and management, On convex relaxations of quadrilinear terms, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Multivariate McCormick relaxations, On tightness and anchoring of McCormick and other relaxations, Convex envelope of bivariate cubic functions over rectangular regions, Global optimality bounds for the placement of control valves in water supply networks, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints, Deterministic global optimization in ab-initio quantum chemistry, Error bounds for monomial convexification in polynomial optimization, Convex relaxation for solving posynomial programs, Nonlinear convex and concave relaxations for the solutions of parametric ODEs, Disjunctive Cuts for Nonconvex MINLP, Comparison of deterministic and stochastic approaches to global optimization, Reformulations in Mathematical Programming: Definitions and Systematics
