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)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29)
Related Items
Disjunctive Cuts for Nonconvex MINLP, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, Bi-objective design-for-control of water distribution networks with global bounds, A review of recent advances in global optimization, Exact and approximate results for convex envelopes of special structured functions over simplices, Temporal linear relaxation in IBM ILOG CP optimizer, Sequence of polyhedral relaxations for nonlinear univariate functions, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, Deterministic global optimization in ab-initio quantum chemistry, Convex relaxation for solving posynomial programs, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Convergence-order analysis of branch-and-bound algorithms for constrained problems, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, Error bounds for monomial convexification in polynomial optimization, A framework for globally optimizing mixed-integer signomial programs, 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, Generalized McCormick relaxations, Convex underestimation for posynomial functions of positive variables, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, Differentiable McCormick relaxations, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Multivariate McCormick relaxations, Comparison of deterministic and stochastic approaches to global optimization, On tightness and anchoring of McCormick and other relaxations, Reformulations in Mathematical Programming: Definitions and Systematics, Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks, Convex envelope of bivariate cubic functions over rectangular regions, Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions, Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions, Conflict Analysis for MINLP, Convex envelopes for ray-concave functions, On the Composition of Convex Envelopes for Quadrilinear Terms, Global optimality bounds for the placement of control valves in water supply networks, Nonlinear convex and concave relaxations for the solutions of parametric ODEs, Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
