On the complexity of optimization over the standard simplex
From MaRDI portal
Publication:932197
DOI10.1016/j.ejor.2007.01.055zbMath1156.90009MaRDI QIDQ932197
Etienne de Klerk, Dick den Hertog, G. Elabwabi
Publication date: 10 July 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.01.055
global optimization; linear programming; PTAS; standard simplex; multivariate Lagrange interpolation; multivariate Bernstein approximation
90C20: Quadratic programming
90C05: Linear programming
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of derivatives of Bernstein approximation
- Bounding the Lebesgue function for Lagrange interpolatin in a simplex
- Inverse theorems for multidimensional Bernstein operators
- Structure preserving reductions among convex optimization problems
- Optimal approximation class for multivariate Bernstein operators
- Korovkin-type approximation theory and its applications
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- The complexity of approximating a nonlinear program
- Polynomial interpolation in several variables
- Geometry of interpolation sets in derivative free optimization
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- A Multivariate Form of Hardy's Inequality and $L_p$-Error Bounds for Multivariate Lagrange Interpolation Schemes
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex
- On Multivariate Lagrange Interpolation
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Some optimal inapproximability results
- Global minimization of increasing positively homogeneous functions over the unit simplex
