An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (Q2349131): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Etienne de Klerk / rank
Normal rank
 
Property / author
 
Property / author: Etienne de Klerk / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2106875569 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1311.0173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Korovkin-type approximation theory and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of approximating a nonlinear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding on the standard simplex: regular grids for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Lebesgue function for Lagrange interpolatin in a simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse theorems for multidimensional Bernstein operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal approximation class for multivariate Bernstein operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3127236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of optimization over the standard simplex / 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: Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed-form Expressions for the Moments of the Binomial Probability Distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of copositive optimization based linear programming bounds on standard quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the accuracy of uniform polyhedral approximations of the copositive cone / rank
 
Normal rank

Latest revision as of 06:17, 10 July 2024

scientific article
Language Label Description Also known as
English
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
scientific article

    Statements

    An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (English)
    0 references
    0 references
    0 references
    0 references
    19 June 2015
    0 references
    polynomial optimization over a simplex
    0 references
    PTAS
    0 references
    Bernstein approximation
    0 references

    Identifiers