Global optimization of nonconvex problems with convex-transformable intermediates
From MaRDI portal
Publication:1756773
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
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A convex envelope formula for multilinear functions
- A hybrid LP/NLP paradigm for global optimization relaxations
- A polyhedral branch-and-cut approach to global optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- BARON: A general purpose global optimization software package
- Benchmarking optimization software with performance profiles.
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- 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
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- 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
- Global optimization of nonconvex problems with multilinear intermediates
- Jointly Constrained Biconvex Programming
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Relaxations of factorable functions with convex-transformable intermediates
- 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
- The global solver in the LINDO API
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
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
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)
