Pages that link to "Item:Q2503350"
From MaRDI portal
The following pages link to A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350):
Displayed 42 items.
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- A refined error analysis for fixed-degree polynomial optimization over the simplex (Q489141) (← links)
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization (Q517310) (← links)
- On the convergence rate of grid search for polynomial optimization over the simplex (Q519777) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems (Q644908) (← links)
- A linear programming reformulation of the standard quadratic optimization problem (Q868634) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- On the complexity of optimization over the standard simplex (Q932197) (← links)
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960) (← links)
- Impossibility of extending Pólya's theorem to ``forms'' with arbitrary real exponents (Q949641) (← links)
- Complexity results for some global optimization problems (Q1024247) (← links)
- A generalization of the Motzkin-Straus theorem to hypergraphs (Q1024737) (← links)
- Improved approximation results on standard quartic polynomial optimization (Q1686564) (← links)
- A continuous characterization of the maximum vertex-weighted clique in hypergraphs (Q1752628) (← links)
- On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
- Approximation algorithm for a class of global optimization problems (Q1937958) (← links)
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization (Q2044964) (← links)
- Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere (Q2080815) (← links)
- Proximity in concave integer quadratic programming (Q2149572) (← links)
- Rounding on the standard simplex: regular grids for global optimization (Q2250080) (← links)
- On an extension of Pólya's Positivstellensatz (Q2342945) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (Q2349131) (← links)
- Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
- On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001) (← links)
- On the accuracy of uniform polyhedral approximations of the copositive cone (Q2885468) (← links)
- On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← links)
- A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis (Q3296188) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
- On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity (Q5108237) (← links)
- Subdeterminants and Concave Integer Quadratic Programming (Q5206942) (← links)
- Lyapunov Exponent of Rank-One Matrices: Ergodic Formula and Inapproximability of the Optimal Distribution (Q5217944) (← links)
- Hardness and Approximation Results for <i>L<sub>p</sub></i>-Ball Constrained Homogeneous Polynomial Optimization Problems (Q5247613) (← links)
- Convergence of the Simplicial Rational Bernstein Form (Q5357007) (← links)
- An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution (Q5502241) (← links)
- Approximating the existential theory of the reals (Q5918470) (← links)
- Approximating the existential theory of the reals (Q5918881) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- An approximation algorithm for indefinite mixed integer quadratic programming (Q6165586) (← links)