The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962)

scientific article; zbMATH DE number 7271852

Language	Label	Description	Also known as
English	The Convex Hull of a Quadratic Constraint over a Polytope	scientific article; zbMATH DE number 7271852

Statements

instance of

scholarly article

0 references

title

The Convex Hull of a Quadratic Constraint over a Polytope (English)

0 references

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

9 November 2020

0 references

full work available at URL

https://arxiv.org/abs/1812.10160

0 references

zbMATH Keywords

convex hull

0 references

quadratic function

0 references

second-order cone

0 references

describes a project that uses

SPOTless

0 references

GloMIQO

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Error bounds for monomial convexification in polynomial optimization

0 references

Jointly Constrained Biconvex Programming

0 references

Strong formulations for the pooling problem

0 references

\(\alpha BB\): A global optimization method for general constrained nonconvex problems

0 references

Computable representations for convex hulls of low-dimensional quadratic forms

0 references

Global optimization of nonconvex problems with multilinear intermediates

0 references

On families of quadratic surfaces having fixed intersections with two hyperplanes

0 references

Q2861492

0 references

Lectures on Modern Convex Optimization

0 references

Concave envelopes of monomial functions over rectangles

0 references

Polynomial Solvability of Variants of the Trust-Region Subproblem

0 references

Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets

0 references

Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow

0 references

Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization

0 references

Second-Order-Cone Constraints for Extended Trust-Region Subproblems

0 references

How to convexify the intersection of a second order cone and a nonconvex quadratic

0 references

Faster, but weaker, relaxations for quadratically constrained quadratic programs

0 references

The trust region subproblem with non-intersecting linear constraints

0 references

A class of valid inequalities for multilinear 0-1 optimization problems

0 references

Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction

0 references

A Polyhedral Study of Binary Polynomial Programs

0 references

Analysis of MILP Techniques for the Pooling Problem

0 references

Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem

0 references

New SOCP relaxation and branching rule for bipartite bilinear programs

0 references

Q4477776

0 references

On representing the positive semidefinite cone using the second-order cone

0 references

.879-approximation algorithms for MAX CUT and MAX 2SAT

0 references

Relaxations and discretizations for the pooling problem

0 references

Extended formulations for convex hulls of some bilinear functions

0 references

Linear programs with an additional reverse convex constraint

0 references

Exact computable representation of some second-order cone constrained quadratic programming problems

0 references

Strong SOCP Relaxations for the Optimal Power Flow Problem

0 references

Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem

0 references

Global Optimization with Polynomials and the Problem of Moments

0 references

Convex envelopes of monomials of odd degree

0 references

Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes

0 references

Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

0 references

Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes

0 references

Convex envelopes for edge-concave functions

0 references

Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2

0 references

Convex hull of two quadratic or a conic quadratic and a quadratic inequality

0 references

Convexification Techniques for Linear Complementarity Constraints

0 references

Facets of a mixed-integer bilinear covering set with bounds on variables

0 references

A convex envelope formula for multilinear functions

0 references

Analysis of bounds for multilinear functions

0 references

Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets

0 references

A reformulation-linearization technique for solving discrete and continuous nonconvex problems

0 references

An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes

0 references

A new reformulation-linearization technique for bilinear programming problems

0 references

Quantifying Double McCormick

0 references

Strong valid inequalities for orthogonal disjunctions and bilinear covering sets

0 references

Explicit convex and concave envelopes through polyhedral subdivisions

0 references

Semidefinite relaxations of fractional programs via novel convexification techniques

0 references

Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications

0 references

Convex analysis and global optimization

0 references

Convex hull of two quadratic constraints is an LMI set

0 references

Identifiers

zbMATH Open document ID

1453.90115

0 references

DOI

10.1137/19M1277333

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5131962