Global optimization of nonconvex problems with convex-transformable intermediates
From MaRDI portal
Publication:1756773
DOI10.1007/s10898-018-0631-4zbMath1417.90121OpenAlexW2794229900MaRDI QIDQ1756773
Carlos J. Nohra, Nikolaos V. Sahinidis
Publication date: 21 December 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0631-4
Related Items
Optimization conditions and decomposable algorithms for convertible nonconvex optimization, Solving generalized polynomial problem by using new affine relaxed technique, The profit-oriented hub line location problem with elastic demand
Uses Software
Cites Work
- 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
- 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
- A hybrid LP/NLP paradigm for global optimization relaxations
- Convex envelopes for edge-concave functions
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- 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
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Global optimization of nonconvex problems with multilinear intermediates
- Relaxations of factorable functions with convex-transformable intermediates
- Convex relaxation for solving posynomial programs
- 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
- Convex underestimation strategies for signomial functions
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Global optimization of nonconvex factorable programming problems
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Benchmarking optimization software with performance profiles.
