Error bounds for monomial convexification in polynomial optimization
From MaRDI portal
Publication:2414910
DOI10.1007/s10107-018-1246-8zbMath1412.90119arXiv1704.00424OpenAlexW2610719402MaRDI QIDQ2414910
Warren P. Adams, Yibo Xu, Akshay Gupte
Publication date: 17 May 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.00424
Nonconvex programming, global optimization (90C26) Approximation by convex sets (52A27) Error analysis and interval analysis (65G99)
Related Items
Exact and approximate results for convex envelopes of special structured functions over simplices, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, The Convex Hull of a Quadratic Constraint over a Polytope, Convex hull representations of special monomials of binary variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
- Reduced RLT representations for nonconvex polynomial programming problems
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- Concave extensions for nonlinear 0-1 maximization problems
- A convex envelope formula for multilinear functions
- Error bounds in mathematical programming
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Convex extensions and envelopes of lower semi-continuous functions
- Convex envelopes of monomials of odd degree
- A class of valid inequalities for multilinear 0-1 optimization problems
- Convex envelopes for edge-concave functions
- A polyhedral branch-and-cut approach to global optimization
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Some results on the strength of relaxations of multilinear functions
- Explicit convex and concave envelopes through polyhedral subdivisions
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Global optimization of nonconvex problems with multilinear intermediates
- On convex envelopes for bivariate functions over polytopes
- Global Optimization with Polynomials and the Problem of Moments
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
- Integer Programming Subject to Monomial Constraints
- Concave envelopes of monomial functions over rectangles
- Branching and bounds tighteningtechniques for non-convex MINLP
- Analysis of MILP Techniques for the Pooling Problem
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Quantifying Double McCormick
- An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution
- A Polyhedral Study of Binary Polynomial Programs
- Analysis of bounds for multilinear functions
