On convex relaxations of quadrilinear terms
From MaRDI portal
Publication:1959235
DOI10.1007/s10898-009-9484-1zbMath1202.90236OpenAlexW2028602808MaRDI QIDQ1959235
Leo Liberti, Jon Lee, Sonia Cafieri
Publication date: 6 October 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9484-1
Related Items
Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations, On linear programming relaxations for solving polynomial programming problems, Deterministic global optimization in ab-initio quantum chemistry, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, Tractable Relaxations of Composite Functions, A framework for globally optimizing mixed-integer signomial programs, Convex underestimators of polynomials, Extended formulations for convex envelopes, A new framework to relax composite functions in nonlinear programs, Packing ellipsoids into volume-minimizing rectangular boxes, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Multivariate McCormick relaxations, On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation, Experimental validation of volume-based comparison for double-McCormick relaxations, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, On the Composition of Convex Envelopes for Quadrilinear Terms, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints, Global optimization of nonconvex problems with multilinear intermediates
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global optimization. From theory to implementation.
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Reformulation in mathematical programming: An application to quantum chemistry
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- Geometric comparison of combinatorial polytopes
- A convex envelope formula for multilinear functions
- Convex extensions and envelopes of lower semi-continuous functions
- Convex envelopes of monomials of odd degree
- A polyhedral branch-and-cut approach to global optimization
- 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
- A branch-and-reduce approach to global optimization
- The Convex Envelope of (n–1)-Convex Functions
- Branching and bounds tighteningtechniques for non-convex MINLP
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
- Computational Experience with the Molecular Distance Geometry Problem
- Analysis of bounds for multilinear functions
