LP formulations for polynomial optimization problems
From MaRDI portal
Recommendations
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Convergent SDP-relaxations for polynomial optimization with sparsity
- The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
Cites work
- scientific article; zbMATH DE number 3837386 (Why is no real title available?)
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 795221 (Why is no real title available?)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- A bounded degree SOS hierarchy for polynomial optimization
- A note on the representation of positive polynomials with structured sparsity
- A sufficient condition for backtrack-bounded search
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
- An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- Complexity of Finding Embeddings in a k-Tree
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube
- Evaluating Gas Network Capacities
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. III. Planar tree-width
- Graphical models, exponential families, and variational inference
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Incidence matrices and interval graphs
- Linear-time computation of optimal subgraphs of decomposable graphs
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Nonconstructive advances in polynomial-time complexity
- Nonserial dynamic programming
- On Integer Programming and the Branch-Width of the Constraint Matrix
- On the MIR Closure of Polyhedra
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Polynomial-time self-reducibility: theoretical motivations and practical results∗
- Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow
- Reduced RLT representations for nonconvex polynomial programming problems
- Solving mixed integer bilinear problems using MILP formulations
- Sparsity in sums of squares of polynomials
- Splitting dense columns of constraint matrix in interior point methods for large scale linear programming11The 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:22A preliminary version of the paper has been presented at the Applied Mathematical Programming and Modelling Symposium APMOD’91 in London, January 14-…
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Sums of squares, moment matrices and optimization over polynomials
- Tree clustering for constraint networks
- Tree-width and the Sherali-Adams operator
Cited in
(20)- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time
- Strong NP-hardness of AC power flows feasibility
- Principled deep neural network training through linear programming
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
- Polynomial Programming: LP-Relaxations Also Converge
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time
- Penalized semidefinite programming for quadratically-constrained quadratic optimization
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- Synthesis for Polynomial Lasso Programs
- The Running Intersection Relaxation of the Multilinear Polytope
- Extended formulations for vertex cover
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- Exploiting sparsity for the min \(k\)-partition problem
- Lagrangian dual for integer optimization with zero duality gap that admits decomposition
- New limits of treewidth-based tractability in optimization
- On optimization problems in acyclic hypergraphs
- The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
This page was built for publication: LP formulations for polynomial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637509)
