Global optimization of nonconvex problems with convex-transformable intermediates
From MaRDI portal
Publication:1756773
DOI10.1007/S10898-018-0631-4zbMATH Open1417.90121OpenAlexW2794229900MaRDI QIDQ1756773FDOQ1756773
Authors: 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
Recommendations
- Relaxations of factorable functions with convex-transformable intermediates
- A polyhedral branch-and-cut approach to global optimization
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Convex Programming Methods for Global Optimization
- Global optimization of general non-convex problems with intermediate bilinear substructures
Cites Work
- BARON: A general purpose global optimization software package
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- The global solver in the LINDO API
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Generalized concavity
- Convex extensions and envelopes of lower semi-continuous functions
- A polyhedral branch-and-cut approach to global optimization
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- Semidefinite relaxations of fractional programs via novel convexification techniques
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A convex envelope formula for multilinear functions
- 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
- Global optimization of nonconvex factorable programming problems
- Some transformation techniques with applications in global optimization
- Convex underestimation strategies for signomial functions
- A hybrid LP/NLP paradigm for global optimization relaxations
- Convex envelopes for edge-concave functions
- Branching and bounds tighteningtechniques for non-convex MINLP
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- The Convex Envelope of (n–1)-Convex Functions
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Convex envelopes of products of convex and component-wise concave functions
- Convex underestimation for posynomial functions of positive variables
- Convex relaxation for solving posynomial programs
- Global optimization of nonconvex problems with multilinear intermediates
- Relaxations of factorable functions with convex-transformable intermediates
Cited In (9)
- Relaxations of factorable functions with convex-transformable intermediates
- Global optimization of nonconvex problems with multilinear intermediates
- The profit-oriented hub line location problem with elastic demand
- A polyhedral branch-and-cut approach to global optimization
- Solving generalized polynomial problem by using new affine relaxed technique
- Global optimization of general non-convex problems with intermediate bilinear substructures
- A general framework for convexity analysis in deterministic global optimization
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization
- Global optimization of general nonconvex problems with intermediate polynomial substructures
Uses Software
This page was built for publication: Global optimization of nonconvex problems with convex-transformable intermediates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756773)
