Relaxations of factorable functions with convex-transformable intermediates
From the authors' conclusions: ``We study convex-transformable functions, an important class of generalized convex functions. We propose a new method to outer-approximate such functions and apply it to a number of important functional forms including signomials, products and ratios of convex and/or concave functions, and log-concave functions. In all instances, the transformation relaxations are shown to be considerably tighter than a widely used factorable scheme. Via an integrated factorable framework, we show that exploiting the convex transformability of sub-expressions of a nonconvex function leads to factorable decompositions that often provide stronger relaxations than a standard approach. This work can be considered as a step towards bridging the gap between generalized convexity and global optimization.
- Global optimization of nonconvex problems with convex-transformable intermediates
- Multivariate McCormick relaxations
- A new framework to relax composite functions in nonlinear programs
- Some results on the strength of relaxations of multilinear functions
- Convex envelopes generated from finitely many compact convex sets
- A polyhedral branch-and-cut approach to global optimization
- Analysis of bounds for multilinear functions
- BARON: A general purpose global optimization software package
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Concavifiability and constructions of concave utility functions
- Convex envelopes for edge-concave functions
- Convex envelopes generated from finitely many compact convex sets
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Convex envelopes of products of convex and component-wise concave functions
- Convex extensions and envelopes of lower semi-continuous functions
- Convex relaxation for solving posynomial programs
- Convex underestimation for posynomial functions of positive variables
- Convex underestimation strategies for signomial functions
- Explicit convex and concave envelopes through polyhedral subdivisions
- Generalized concavity
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of nonconvex factorable programming problems
- scientific article; zbMATH DE number 3847327 (Why is no real title available?)
- scientific article; zbMATH DE number 3456685 (Why is no real title available?)
- scientific article; zbMATH DE number 1857671 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 3417266 (Why is no real title available?)
- scientific article; zbMATH DE number 3417267 (Why is no real title available?)
- scientific article; zbMATH DE number 3084780 (Why is no real title available?)
- Jointly Constrained Biconvex Programming
- Least concave utility functions
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Some transformation techniques with applications in global optimization
- The Convex Envelope of (n–1)-Convex Functions
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Domain reduction techniques for global NLP and MINLP optimization
- Global optimization of nonconvex problems with convex-transformable intermediates
- Convex envelopes for ray-concave functions
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- A new framework to relax composite functions in nonlinear programs
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- On tightness and anchoring of McCormick and other relaxations
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
- Solving generalized polynomial problem by using new affine relaxed technique
- Tractable relaxations of composite functions
- (Global) optimization: historical notes and recent developments
- Solving continuous and discrete nonlinear programs with BARON
- 50 years of mixed-integer nonlinear and disjunctive programming
This page was built for publication: Relaxations of factorable functions with convex-transformable intermediates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452375)
