Convex envelopes for edge-concave functions
From MaRDI portal
Publication:1780948
DOI10.1007/s10107-005-0580-9zbMath1099.90045OpenAlexW2077654805MaRDI QIDQ1780948
Clifford A. Meyer, Christodoulos A. Floudas
Publication date: 14 June 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0580-9
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (59)
Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations ⋮ Global optimization with spline constraints: a new branch-and-bound method based on B-splines ⋮ Convex envelopes of separable functions over regions defined by separable functions of the same type ⋮ A review of recent advances in global optimization ⋮ Exact and approximate results for convex envelopes of special structured functions over simplices ⋮ Non polyhedral convex envelopes for 1-convex functions ⋮ Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Deriving convex hulls through lifting and projection ⋮ Convex relaxation for solving posynomial programs ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems ⋮ Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations ⋮ Some results on the strength of relaxations of multilinear functions ⋮ Global dynamic optimization using edge-concave underestimator ⋮ 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 ⋮ A new technique to derive tight convex underestimators (sometimes envelopes) ⋮ Convex envelopes generated from finitely many compact convex sets ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Convex envelopes of products of convex and component-wise concave functions ⋮ Explicit convex and concave envelopes through polyhedral subdivisions ⋮ A review of deterministic optimization methods in engineering and management ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ Deterministic global optimization of steam cycles using the IAPWS-IF97 model ⋮ Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program ⋮ Efficient Convexification Strategy for Generalized Geometric Programming Problems ⋮ On convex envelopes for bivariate functions over polytopes ⋮ 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 ⋮ Convex underestimation for posynomial functions of positive variables ⋮ Existence and sum decomposition of vertex polyhedral convex envelopes ⋮ Bounds tightening based on optimality conditions for nonconvex box-constrained optimization ⋮ A technique to derive the analytical form of convex envelopes for some bivariate functions ⋮ ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations ⋮ Multivariate McCormick relaxations ⋮ 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 ⋮ Piecewise-linear approximations of multidimensional functions ⋮ Unnamed Item ⋮ On tightness and anchoring of McCormick and other relaxations ⋮ On convex envelopes and regularization of non-convex functionals without moving global minima ⋮ 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. II: Multivariate functions ⋮ Deterministic global optimization with Gaussian processes embedded ⋮ Convex envelopes for ray-concave functions ⋮ On the Composition of Convex Envelopes for Quadrilinear Terms ⋮ New SOCP relaxation and branching rule for bipartite bilinear programs ⋮ Global optimization of nonconvex problems with multilinear intermediates ⋮ Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concave extensions for nonlinear 0-1 maximization problems
- A simple and relatively efficient triangulation of the n-cube
- A triangulation of the n-cube
- Minimal triangulation of the 4-cube
- A new reformulation-linearization technique for bilinear programming problems
- Triangulations for the cube
- Lower bounds on cube simplexity
- A convex envelope formula for multilinear functions
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Convex extensions and envelopes of lower semi-continuous functions
- Simplexity of the cube
- Product disaggregation in global optimization and relaxations of rational programs
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
This page was built for publication: Convex envelopes for edge-concave functions