Pages that link to "Item:Q940826"

The following pages link to The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826):

Displaying 26 items.

• Copositive optimization -- recent developments and applications (Q421783) (← links)
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
• On the computational complexity of membership problems for the completely positive cone and its dual (Q461444) (← links)
• A refined error analysis for fixed-degree polynomial optimization over the simplex (Q489141) (← links)
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
• Convex optimization approach to a single quadratically constrained quadratic minimization problem (Q623792) (← links)
• Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems (Q644908) (← links)
• A note on total degree polynomial optimization by Chebyshev grids (Q683923) (← links)
• An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
• A generalization of the Motzkin-Straus theorem to hypergraphs (Q1024737) (← links)
• Self-concordance is NP-hard (Q1675557) (← links)
• Improved approximation results on standard quartic polynomial optimization (Q1686564) (← links)
• Separable standard quadratic optimization problems (Q1758025) (← links)
• Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization (Q1800451) (← links)
• Approximation algorithm for a class of global optimization problems (Q1937958) (← links)
• NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256) (← links)
• Homogeneous polynomials and spurious local minima on the unit sphere (Q2128762) (← links)
• The sum-of-squares hierarchy on the sphere and applications in quantum information theory (Q2235150) (← links)
• Rounding on the standard simplex: regular grids for global optimization (Q2250080) (← links)
• Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies (Q2329654) (← links)
• Quantum de Finetti theorems under local measurements with applications (Q2358805) (← links)
• Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
• A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis (Q3296188) (← links)
• The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem (Q5219559) (← links)
• Optimality conditions for homogeneous polynomial optimization on the unit sphere (Q6097490) (← links)
• An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)