Relaxations of factorable functions with convex-transformable intermediates

DOI10.1007/S10107-012-0618-8zbMath1301.65047OpenAlexW1994322014MaRDI QIDQ2452375

Jeremy J. Michalek, Nikolaos V. Sahinidis, Aida Khajavirad

Publication date: 2 June 2014

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-0618-8

zbMATH Keywords

global optimizationgeneralized convexityconvexificationfactorable programming\(G\)-convex functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (8)

Solving generalized polynomial problem by using new affine relaxed technique ⋮ Optimality-based domain reduction for inequality-constrained NLP and MINLP problems ⋮ (Global) optimization: historical notes and recent developments ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Global optimization of general nonconvex problems with intermediate polynomial substructures ⋮ Global optimization of nonconvex problems with convex-transformable intermediates ⋮ On tightness and anchoring of McCormick and other relaxations ⋮ Convex envelopes for ray-concave functions

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex envelopes of products of convex and component-wise concave functions
• Convex underestimation for posynomial functions of positive variables
• Some transformation techniques with applications in global optimization
• Generalized concavity
• Least concave utility functions
• Concavifiability and constructions of concave utility functions
• Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
• Convex extensions and envelopes of lower semi-continuous functions
• 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
• Convex envelopes generated from finitely many compact convex sets
• Explicit convex and concave envelopes through polyhedral subdivisions
• Convex relaxation for solving posynomial programs
• The Convex Envelope of (n–1)-Convex Functions
• Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
• Convex underestimation strategies for signomial functions
• Jointly Constrained Biconvex Programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Global optimization of nonconvex factorable programming problems
• Analysis of bounds for multilinear functions
• Semidefinite relaxations of fractional programs via novel convexification techniques

This page was built for publication: Relaxations of factorable functions with convex-transformable intermediates