Global optimization of nonconvex problems with convex-transformable intermediates
type: Item
instance of: scholarly article
title: Global optimization of nonconvex problems with convex-transformable intermediates
zbMATH Open document ID: 1417.90121
author: Carlos J. Nohra
author: Nikolaos V. Sahinidis
published in: Journal of Global Optimization
publication date: 2018-12-21T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6996791
zbMATH Keywords: global optimization
zbMATH Keywords: G-convexity cuts
zbMATH Keywords: factorable programming
describes a project that uses: SCIP
describes a project that uses: LINDO
describes a project that uses: BARON
describes a project that uses: AIMMS
describes a project that uses: MINLPLib
describes a project that uses: ANTIGONE
describes a project that uses: LINDOGlobal
MaRDI profile type: Publication
full work available at URL: s10898-018-0631-4
OpenAlex ID: W2794229900
cites work: Jointly Constrained Biconvex Programming
cites work: Generalized concavity
cites work: Global optimization of nonconvex problems with multilinear intermediates
cites work: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: Q4821526
cites work: MINLPLib -- a collection of test models for mixed-integer nonlinear programming
cites work: Benchmarking optimization software with performance profiles.
cites work: The Convex Envelope of (n–1)-Convex Functions
cites work: Relaxations of factorable functions with convex-transformable intermediates
cites work: Convex envelopes of products of convex and component-wise concave functions
cites work: Convex envelopes generated from finitely many compact convex sets
cites work: A hybrid LP/NLP paradigm for global optimization relaxations
cites work: Convex underestimation for posynomial functions of positive variables
cites work: The global solver in the LINDO API
cites work: Convex relaxation for solving posynomial programs
cites work: Some transformation techniques with applications in global optimization
cites work: Convex underestimation strategies for signomial functions
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
cites work: Convex envelopes for edge-concave functions
cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
cites work: A convex envelope formula for multilinear functions
cites work: BARON: A general purpose global optimization software package
cites work: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
cites work: Global optimization of nonconvex factorable programming problems
cites work: Explicit convex and concave envelopes through polyhedral subdivisions
cites work: Semidefinite relaxations of fractional programs via novel convexification techniques
cites work: Convex extensions and envelopes of lower semi-continuous functions
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
cites work: A polyhedral branch-and-cut approach to global optimization
DOI: 10.1007/S10898-018-0631-4
description: scientific article; zbMATH DE number 6996791