A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350): 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 / Wikidata QID
 
Property / Wikidata QID: Q101511646 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114650657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure preserving reductions among convex optimization problems / 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: On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4464661 / 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: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Class of Finite Elements Generated by Lagrange Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for Pólya's theorem with applications to polynomials positive on polyhedra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for sums of squares of real polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of even powers of real linear forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform denominators in Hilbert's seventeenth problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(K\)-moment problem for compact semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: LMI Approximations for Cones of Positive Semidefinite Forms / rank
 
Normal rank

Latest revision as of 20:24, 24 June 2024

scientific article
Language Label Description Also known as
English
A PTAS for the minimization of polynomials of fixed degree over the simplex
scientific article

    Statements

    A PTAS for the minimization of polynomials of fixed degree over the simplex (English)
    0 references
    0 references
    0 references
    0 references
    14 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    semidefinite programming
    0 references
    global optimization
    0 references
    positive polynomial
    0 references
    sum of squares of polynomials
    0 references
    approximation algorithm
    0 references
    0 references
    0 references