On convex relaxations of quadrilinear terms
type: Item
instance of: scholarly article
title: On convex relaxations of quadrilinear terms
zbMATH Open document ID: 1202.90236
author: Sonia Cafieri
author: Jon Lee
author: Leo Liberti
published in: Journal of Global Optimization
publication date: 2010-10-06T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5796460
zbMATH Keywords: reformulation
zbMATH Keywords: global optimization
zbMATH Keywords: spatial branch and bound
describes a project that uses: cdd
describes a project that uses: BARON
describes a project that uses: SNOPT
describes a project that uses: AMPL
describes a project that uses: CPLEX
describes a project that uses: ROSE
MaRDI profile type: Publication
full work available at URL: s10898-009-9484-1
OpenAlex ID: W2028602808
cites work: Jointly Constrained Biconvex Programming
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: Q5461825
cites work: Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
cites work: Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
cites work: The Convex Envelope of (n–1)-Convex Functions
cites work: Q5492539
cites work: Computational Experience with the Molecular Distance Geometry Problem
cites work: A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
cites work: Geometric comparison of combinatorial polytopes
cites work: Q4817248
cites work: Q5492526
cites work: Global optimization. From theory to implementation.
cites work: Convex envelopes of monomials of odd degree
cites work: Reformulation in mathematical programming: An application to quantum chemistry
cites work: Double variable neighbourhood search with smoothing for the molecular distance geometry problem
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Q4464676
cites work: Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
cites work: Q4385537
cites work: Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
cites work: A convex envelope formula for multilinear functions
cites work: A branch-and-reduce approach to global optimization
cites work: Analysis of bounds for multilinear functions
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: Existence and sum decomposition of vertex polyhedral convex envelopes
cites work: Convex extensions and envelopes of lower semi-continuous functions
cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
DOI: 10.1007/S10898-009-9484-1
Recommended article: On convex relaxations for quadratically constrained quadratic programming
Recommended article: On linear conic relaxation of discrete quadratic programs
Recommended article: Convex Relaxations of (0, 1)-Quadratic Programming
Recommended article: On the Composition of Convex Envelopes for Quadrilinear Terms
Recommended article: Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
Recommended article: Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
Recommended article: Linear and parabolic relaxations for quadratic constraints
Recommended article: Q5045849
Recommended article: Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
Recommended article: A new convex relaxation for quadratically constrained quadratic programming
description: scientific article; zbMATH DE number 5796460