Pages that link to "Item:Q644908"

The following pages link to Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems (Q644908):

Displaying 13 items.

• A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure (Q274079) (← links)
• Concepts and techniques of optimization on the sphere (Q287654) (← links)
• A note on semidefinite programming relaxations for polynomial optimization over a single sphere (Q341317) (← links)
• Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
• Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints (Q481050) (← links)
• On cones of nonnegative quartic forms (Q525602) (← links)
• Approximation algorithms for optimization of real-valued general conjugate complex forms (Q683722) (← links)
• Approximation algorithms for nonnegative polynomial optimization problems over unit spheres (Q721466) (← links)
• Approximation methods for complex polynomial optimization (Q742305) (← links)
• On the spherical quasi-convexity of quadratic functions on spherically subdual convex sets (Q831352) (← links)
• On the spherical quasi-convexity of quadratic functions (Q1629842) (← links)
• Improved approximation results on standard quartic polynomial optimization (Q1686564) (← links)
• On solving biquadratic optimization via semidefinite relaxation (Q1935575) (← links)