Convex envelopes for edge-concave functions

DOI10.1007/S10107-005-0580-9zbMATH Open1099.90045OpenAlexW2077654805MaRDI QIDQ1780948FDOQ1780948

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2068080
• Explicit convex and concave envelopes through polyhedral subdivisions
• The Convex Envelope of (n–1)-Convex Functions
• Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
• Concave envelopes of monomial functions over rectangles

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)

Cites Work

• Convex extensions and envelopes of lower semi-continuous functions
• Title not available (Why is that?)
• A new reformulation-linearization technique for bilinear programming problems
• Jointly Constrained Biconvex Programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• A convex envelope formula for multilinear functions
• Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
• Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
• Title not available (Why is that?)
• Concave extensions for nonlinear 0-1 maximization problems
• Product disaggregation in global optimization and relaxations of rational programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A simple and relatively efficient triangulation of the n-cube
• A triangulation of the n-cube
• A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes
• Minimal triangulation of the 4-cube
• Triangulations for the cube
• Simplexity of the cube
• Title not available (Why is that?)
• Lower bounds on cube simplexity

Cited In (63)

• Relaxations of factorable functions with convex-transformable intermediates
• Convex and concave envelopes: revisited and new perspectives
• Valid inequalities and convex hulls for multilinear functions
• The Convex Envelope of (n–1)-Convex Functions
• Efficient Convexification Strategy for Generalized Geometric Programming Problems
• Convex envelopes of bivariate functions through the solution of KKT systems
• The convex hull of a quadratic constraint over a polytope
• A review of recent advances in global optimization
• Global optimization of nonconvex problems with multilinear intermediates
• On tightness and anchoring of McCormick and other relaxations
• Convex envelopes of separable functions over regions defined by separable functions of the same type
• Deriving convex hulls through lifting and projection
• Global optimization of nonconvex problems with convex-transformable intermediates
• Deterministic global optimization with Gaussian processes embedded
• Global optimization with spline constraints: a new branch-and-bound method based on B-splines
• Exact and approximate results for convex envelopes of special structured functions over simplices
• Convex envelopes generated from finitely many compact convex sets
• Explicit convex and concave envelopes through polyhedral subdivisions
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
• Non polyhedral convex envelopes for 1-convex functions
• Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
• Convex envelopes of products of convex and component-wise concave functions
• Piecewise-linear approximations of multidimensional functions
• Title not available (Why is that?)
• Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
• Extended formulations for convex envelopes
• On the Composition of Convex Envelopes for Quadrilinear Terms
• A convex envelope formula for multilinear functions
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks
• On convex envelopes and regularization of non-convex functionals without moving global minima
• A framework for globally optimizing mixed-integer signomial programs
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
• The multilinear polytope for acyclic hypergraphs
• An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
• GLOMIQO: global mixed-integer quadratic optimizer
• Existence and sum decomposition of vertex polyhedral convex envelopes
• New SOCP relaxation and branching rule for bipartite bilinear programs
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
• Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
• A review of deterministic optimization methods in engineering and management
• Convex relaxation for solving posynomial programs
• 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
• Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
• Error bounds for monomial convexification in polynomial optimization
• Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
• Some results on the strength of relaxations of multilinear functions
• Domain reduction techniques for global NLP and MINLP optimization
• Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
• On convex envelopes for bivariate functions over polytopes
• A technique to derive the analytical form of convex envelopes for some bivariate functions
• Global dynamic optimization using edge-concave underestimator
• Convex envelope of bivariate cubic functions over rectangular regions
• Multivariate McCormick relaxations
• Convex underestimation for posynomial functions of positive variables
• Convex envelopes for ray-concave functions
• Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
• Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
• Deterministic global optimization of steam cycles using the IAPWS-IF97 model
• A new technique to derive tight convex underestimators (sometimes envelopes)
• (Global) optimization: historical notes and recent developments

This page was built for publication: Convex envelopes for edge-concave functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1780948)