On linear programming relaxations for solving polynomial programming problems
type: Item
instance of: scholarly article
title: On linear programming relaxations for solving polynomial programming problems
zbMATH Open document ID: 1458.90521
author: Evrim Dalkiran
author: Laleh Ghalami
published in: Computers \& Operations Research
publication date: 2018-08-08T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6914688
zbMATH Keywords: reformulation-linearization technique (RLT)
zbMATH Keywords: \(J\)-set relaxation
zbMATH Keywords: McCormick inequalities
zbMATH Keywords: polynomial programming problems
zbMATH Keywords: linear programming relaxations
zbMATH Keywords: branch-and-bound algorithms
describes a project that uses: SNOPT
describes a project that uses: CPLEX
describes a project that uses: ANTIGONE
describes a project that uses: RLT-POS
MaRDI profile type: Publication
full work available at URL: j.cor.2018.06.010
OpenAlex ID: W2808841732
cites work: A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems
cites work: On convex relaxations for quadratically constrained quadratic programming
cites work: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
cites work: Global optimization of nonconvex problems with multilinear intermediates
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: An improved branch and bound algorithm for mixed integer nonlinear programs
cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
cites work: On convex relaxations of quadrilinear terms
cites work: Maximizing the number of conflict-free aircraft using mixed-integer nonlinear programming
cites work: Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
cites work: RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
cites work: Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
cites work: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
cites work: Generating cutting planes for the semidefinite relaxation of quadratic programs
cites work: Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
cites work: Global optimization with polynomials and the problem of moments
cites work: Semidefinite Programming vs. LP Relaxations for Polynomial Programming
cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
cites work: Some results on the strength of relaxations of multilinear functions
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
cites work: Semidefinite programming relaxations for semialgebraic problems
cites work: A convex envelope formula for multilinear functions
cites work: Analysis of bounds for multilinear functions
cites work: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems
cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
cites work: Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
cites work: Global optimization of nonconvex factorable programming problems
cites work: Dual quadratic estimates in polynomial and Boolean programming
cites work: Quantifying Double McCormick
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: Global minimization of a difference of two convex functions
cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
cites work: A new linearization method for generalized linear multiplicative programming
Wikidata QID: Q129625558
DOI: 10.1016/J.COR.2018.06.010
description: scientific article; zbMATH DE number 6914688