On the complexity of optimization over the standard simplex (Q932197): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Korovkin-type approximation theory and its applications / 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: Global minimization of increasing positively homogeneous functions over the unit simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783458 / 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: Bounding the Lebesgue function for Lagrange interpolatin in a simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of interpolation sets in derivative free optimization / 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: Q4273944 / 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: Q4464661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of derivatives of Bernstein approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial interpolation in several variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840971 / 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: On Multivariate Lagrange Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multivariate Form of Hardy's Inequality and $L_p$-Error Bounds for Multivariate Lagrange Interpolation Schemes / rank
 
Normal rank

Revision as of 12:15, 28 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of optimization over the standard simplex
scientific article

    Statements

    On the complexity of optimization over the standard simplex (English)
    0 references
    0 references
    0 references
    0 references
    10 July 2008
    0 references
    global optimization
    0 references
    standard simplex
    0 references
    PTAS
    0 references
    multivariate Bernstein approximation
    0 references
    multivariate Lagrange interpolation
    0 references
    linear programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers