LP Formulations for Polynomial Optimization Problems (Q4637509): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 09:26, 30 July 2024

scientific article; zbMATH DE number 6864009

Language	Label	Description	Also known as
English	LP Formulations for Polynomial Optimization Problems	scientific article; zbMATH DE number 6864009

Statements

scholarly article

0 references

LP Formulations for Polynomial Optimization Problems (English)

0 references

Bienstock, Daniel

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

24 April 2018

0 references

zbMATH Keywords

tree-width

0 references

polynomial optimization

0 references

linear programming

0 references

MaRDI profile type

MaRDI publication profile

0 references

Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey

0 references

Complexity of Finding Embeddings in a <i>k</i>-Tree

0 references

0 references

Linear-time computation of optimal subgraphs of decomposable graphs

0 references

Nonserial dynamic programming

0 references

0 references

Tree-width and the Sherali-Adams operator

0 references

0 references

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

0 references

Strong reductions for extended formulations

0 references

Polynomial-time self-reducibility: theoretical motivations and practical results<sup>∗</sup>

0 references

On Integer Programming and the Branch-Width of the Constraint Matrix

0 references

On the MIR Closure of Polyhedra

0 references

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

0 references

A PTAS for the minimization of polynomials of fixed degree over the simplex

0 references

An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex

0 references

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

0 references

Tree clustering for constraint networks

0 references

Nonconstructive advances in polynomial-time complexity

0 references

A sufficient condition for backtrack-bounded search

0 references

Incidence matrices and interval graphs

0 references

Improved Linear Integer Programming Formulations of Nonlinear Integer Problems

0 references

Splitting dense columns of constraint matrix in interior point methods for large scale linear programming<sup>1</sup><sup>1</sup>The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex 16, France$ef:<sup>2</sup><sup>2</sup>A preliminary version of the paper has been presented at the Applied Mathematical Programming and Modelling Symposium APMOD’91 in London, January 14-…

0 references

A note on the representation of positive polynomials with structured sparsity

0 references

Solving Mixed Integer Bilinear Problems Using MILP Formulations

0 references

Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem

0 references

Evaluating Gas Network Capacities

0 references

Sparsity in sums of squares of polynomials

0 references

Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity

0 references

A bounded degree SOS hierarchy for polynomial optimization

0 references

0 references

0 references

Optimality conditions and finite convergence of Lasserre's hierarchy

0 references

Graph minors. III. Planar tree-width

0 references

Graph minors. II. Algorithmic aspects of tree-width

0 references

A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems

0 references

Reduced RLT representations for nonconvex polynomial programming problems

0 references

New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems

0 references

Graphical Models, Exponential Families, and Variational Inference

0 references

Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity

0 references

full work available at URL

https://doi.org/10.1137/15m1054079

0 references

Identifiers

zbMATH Open document ID

0 references

10.1137/15M1054079

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4637509

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