Explicit convex and concave envelopes through polyhedral subdivisions

DOI10.1007/s10107-012-0581-4zbMath1273.90165OpenAlexW2080116182MaRDI QIDQ1949256

Chuanhui Xiong, Jean-Philippe P. Richard, Mohit Tawarmalani

Publication date: 6 May 2013

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0581-4

zbMATH Keywords

concave envelope convex envelope supermodular function hyper-rectangle

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Related Items

Optimistic MILP modeling of non-linear optimization problems, Convex envelopes of separable functions over regions defined by separable functions of the same type, Exact and approximate results for convex envelopes of special structured functions over simplices, Non polyhedral convex envelopes for 1-convex functions, Optimization conditions and decomposable algorithms for convertible nonconvex optimization, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Deriving convex hulls through lifting and projection, Perspective Reformulations of the CTA Problem with L₂ Distances, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, Tractable Relaxations of Composite Functions, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, On the game interpretation of a shadow price process in utility maximization problems under transaction costs, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Error bounds for monomial convexification in polynomial optimization, A framework for globally optimizing mixed-integer signomial programs, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex, (Global) optimization: historical notes and recent developments, On the impact of running intersection inequalities for globally solving polynomial optimization problems, Outer-product-free sets for polynomial optimization and oracle-based cuts, A new technique to derive tight convex underestimators (sometimes envelopes), Convex envelopes generated from finitely many compact convex sets, On the strength of recursive McCormick relaxations for binary polynomial optimization, Domain reduction techniques for global NLP and MINLP optimization, Convex envelopes of products of convex and component-wise concave functions, The Convex Hull of a Quadratic Constraint over a Polytope, Relaxations of factorable functions with convex-transformable intermediates, Convex and concave envelopes: revisited and new perspectives, Extended formulations for convex envelopes, The Multilinear Polytope for Acyclic Hypergraphs, A new framework to relax composite functions in nonlinear programs, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, How to convexify the intersection of a second order cone and a nonconvex quadratic, Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions, A technique to derive the analytical form of convex envelopes for some bivariate functions, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Global optimization of general nonconvex problems with intermediate polynomial substructures, Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes, Global optimization of nonconvex problems with convex-transformable intermediates, Convex envelopes of bivariate functions through the solution of KKT systems, Global optimization of general non-convex problems with intermediate bilinear substructures, Convex envelope of bivariate cubic functions over rectangular regions, Convex hull representations of special monomials of binary variables, Convex envelopes for ray-concave functions, Extended formulations for convex hulls of some bilinear functions, New SOCP relaxation and branching rule for bipartite bilinear programs, Probability estimation via policy restrictions, convexification, and approximate sampling, Dominating occupancy processes by the independent site approximation, Global optimization of nonconvex problems with multilinear intermediates, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production, Approximated perspective relaxations: a project and lift approach

Uses Software

Cites Work