Convex envelopes generated from finitely many compact convex sets
From MaRDI portal
Publication:1942266
DOI10.1007/s10107-011-0496-5zbMath1284.90055OpenAlexW2001451578MaRDI QIDQ1942266
Nikolaos V. Sahinidis, Aida Khajavirad
Publication date: 18 March 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-011-0496-5
global optimizationconvex envelopeperspective transformationsubmodular functionsfactorable relaxations
Related Items
Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations, Exact and approximate results for convex envelopes of special structured functions over simplices, Non polyhedral convex envelopes for 1-convex functions, 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 L2 Distances, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, A framework for globally optimizing mixed-integer signomial programs, A computational study of perspective cuts, 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), Domain reduction techniques for global NLP and MINLP optimization, Convex envelopes of products of convex and component-wise concave functions, Relaxations of factorable functions with convex-transformable intermediates, Extended formulations for convex envelopes, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, A new framework to relax composite functions in nonlinear programs, Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques, 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, Global optimization of general nonconvex problems with intermediate polynomial substructures, 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, On tightness and anchoring of McCormick and other relaxations, Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks, Convex envelope of bivariate cubic functions over rectangular regions, Convex envelopes for ray-concave functions, 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
- Unnamed Item
- Unnamed Item
- Convex envelopes of products of convex and component-wise concave functions
- Existence and sum decomposition of vertex polyhedral convex envelopes
- 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
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Convex envelopes for edge-concave functions
- A polyhedral branch-and-cut approach to global optimization
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- BARON: A general purpose global optimization software package
- Explicit convex and concave envelopes through polyhedral subdivisions
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- The Convex Envelope of (n–1)-Convex Functions
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Jointly Constrained Biconvex Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Disjunctive Programming
- Variational Analysis
- Convex Analysis
- Semidefinite relaxations of fractional programs via novel convexification techniques
