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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3042417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computation of optimal subgraphs of decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width and the Sherali-Adams operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong reductions for extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time self-reducibility: theoretical motivations and practical results<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Integer Programming and the Branch-Width of the Constraint Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the MIR Closure of Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the minimization of polynomials of fixed degree over the simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree clustering for constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive advances in polynomial-time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for backtrack-bounded search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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-… / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the representation of positive polynomials with structured sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Mixed Integer Bilinear Problems Using MILP Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Gas Network Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity in sums of squares of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bounded degree SOS hierarchy for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions and finite convergence of Lasserre's hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced RLT representations for nonconvex polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical Models, Exponential Families, and Variational Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/15m1054079 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2801165240 / rank
 
Normal rank

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

    LP Formulations for Polynomial Optimization Problems (English)
    0 references
    0 references
    0 references
    24 April 2018
    0 references
    tree-width
    0 references
    polynomial optimization
    0 references
    linear programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers