Global optimization of nonconvex problems with multilinear intermediates
From MaRDI portal
Publication:2356333
DOI10.1007/s12532-014-0073-zzbMath1317.90243OpenAlexW1975903957MaRDI QIDQ2356333
Nikolaos V. Sahinidis, Xiaowei Bao, Mohit Tawarmalani, Aida Khajavirad
Publication date: 29 July 2015
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-014-0073-z
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
A hybrid LP/NLP paradigm for global optimization relaxations, Optimization conditions and decomposable algorithms for convertible nonconvex optimization, Solving generalized polynomial problem by using new affine relaxed technique, On linear programming relaxations for solving polynomial programming problems, On decomposability of multilinear sets, Piecewise polyhedral formulations for a multilinear term, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, Error bounds for monomial convexification in polynomial optimization, On the impact of running intersection inequalities for globally solving polynomial optimization problems, On the strength of recursive McCormick relaxations for binary polynomial optimization, A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps, Domain reduction techniques for global NLP and MINLP optimization, The Convex Hull of a Quadratic Constraint over a Polytope, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, The Multilinear Polytope for Acyclic Hypergraphs, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, A new framework to relax composite functions in nonlinear programs, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Multivariate McCormick relaxations, 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, Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
Uses Software
Cites Work
- Unnamed Item
- Concave extensions for nonlinear 0-1 maximization problems
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Recognition problems for special classes of polynomials in 0-1 variables
- Some simplified NP-complete graph problems
- A convex envelope formula for multilinear functions
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- 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
- Some results on the strength of relaxations of multilinear functions
- Explicit convex and concave envelopes through polyhedral subdivisions
- On convex relaxations of quadrilinear terms
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- The global solver in the LINDO API
- Jointly Constrained Biconvex Programming
- An Efficient Heuristic Procedure for Partitioning Graphs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- An Algorithm for Separable Nonconvex Programming Problems
- Analysis of bounds for multilinear functions
- Benchmarking optimization software with performance profiles.
