Error bounds for monomial convexification in polynomial optimization (Q2414910): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 15:18, 25 October 2024

scientific article

Language	Label	Description	Also known as
English	Error bounds for monomial convexification in polynomial optimization	scientific article

Statements

scholarly article

0 references

Error bounds for monomial convexification in polynomial optimization (English)

0 references

Warren P. Adams

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

17 May 2019

0 references

full work available at URL

https://arxiv.org/abs/1704.00424

0 references

zbMATH Keywords

polynomial optimization

0 references

monomial

0 references

multilinear

0 references

convex hull

0 references

error analysis

0 references

means inequality

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

0 references

Jointly Constrained Biconvex Programming

0 references

Global optimization of nonconvex problems with multilinear intermediates

0 references

Branching and bounds tighteningtechniques for non-convex MINLP

0 references

0 references

Concave envelopes of monomial functions over rectangles

0 references

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions

0 references

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

0 references

Integer Programming Subject to Monomial Constraints

0 references

Concave extensions for nonlinear 0-1 maximization problems

0 references

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

0 references

RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems

0 references

Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube

0 references

An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution

0 references

A Polyhedral Study of Binary Polynomial Programs

0 references

Analysis of MILP Techniques for the Pooling Problem

0 references

Global Optimization with Polynomials and the Problem of Moments

0 references

An Introduction to Polynomial and Semi-Algebraic Optimization

0 references

0 references

Convex envelopes of monomials of odd degree

0 references

A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs

0 references

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

0 references

On convex envelopes for bivariate functions over polytopes

0 references

Some results on the strength of relaxations of multilinear functions

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

ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations

0 references

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

0 references

Error bounds in mathematical programming

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

Reduced RLT representations for nonconvex polynomial programming problems

0 references

Quantifying Double McCormick

0 references

Explicit convex and concave envelopes through polyhedral subdivisions

0 references

Convex extensions and envelopes of lower semi-continuous functions

0 references

A polyhedral branch-and-cut approach to global optimization

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10107-018-1246-8

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2414910

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2414910&oldid=37861667"