A refined error analysis for fixed-degree polynomial optimization over the simplex (Q489141): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2128643477 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1312.5873 / 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: The complexity of optimizing over a simplex, hypercube or sphere: a short survey / 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: On the complexity of optimization over the standard 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: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Stability Number of a Graph Via Linear and Semidefinite Programming / 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: 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 13:54, 9 July 2024

scientific article
Language Label Description Also known as
English
A refined error analysis for fixed-degree polynomial optimization over the simplex
scientific article

    Statements

    A refined error analysis for fixed-degree polynomial optimization over the simplex (English)
    0 references
    0 references
    27 January 2015
    0 references
    polynomial optimization over the simplex
    0 references
    global optimization
    0 references
    nonlinear optimization
    0 references

    Identifiers