Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
From MaRDI portal
Publication:644908
Recommendations
- Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
Cites work
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- A Unified Theorem on SDP Rank Reduction
- A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Conditions for strong ellipticity and M-eigenvalues
- Conditions for strong ellipticity of anisotropic elastic materials
- Decoupling inequalities for polynomial chaos
- Deterministic and randomized polynomial‐time approximation of radii
- Eigenvalues of a real supersymmetric tensor
- Geometric algorithms and combinatorial optimization.
- Global optimization with polynomials and the problem of moments
- Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
- Integration and optimization of multivariate polynomials by restriction onto a random subspace
- Linear Equations Modulo 2 and the $L_1$ Diameter of Convex Bodies
- Most tensor problems are NP-hard
- Multiarray signal processing: tensor decomposition meets compressed sensing
- Singular Value Decompositions and Low Rank Approximations of Tensors
- Spectral methods for matrices and tensors
- Sums of squares, moment matrices and optimization over polynomials
- Tensor Decompositions and Applications
- Tensor approximation and signal processing applications
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- Z-eigenvalue methods for a global polynomial optimization problem
Cited in
(34)- On the spherical quasi-convexity of quadratic functions
- Semi-definite representations for sets of cubics on the two-dimensional sphere
- Critical values of multilinear Forms under conic constraints
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- Probability bounds for polynomial functions in random variables
- On the spherical quasi-convexity of quadratic functions on spherically subdual convex sets
- scientific article; zbMATH DE number 880231 (Why is no real title available?)
- Concepts and techniques of optimization on the sphere
- Rank-1 tensor properties with applications to a class of tensor optimization problems
- On solving biquadratic optimization via semidefinite relaxation
- Improved approximation results on standard quartic polynomial optimization
- Bounds on the spectral norm and the nuclear norm of a tensor based on tensor partitions
- From the simplex to the sphere: faster constrained optimization using the Hadamard parametrization
- Lower bounds for cubic optimization over the sphere
- Extremal cubics on the circle and the 2-sphere
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- On the spherical convexity of quadratic functions
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- On approximation algorithm for orthogonal low-rank tensor approximation
- Approximation algorithms for discrete polynomial optimization
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- On norm compression inequalities for partitioned block tensors
- Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints
- On cones of nonnegative quartic forms
- An efficient alternating minimization method for fourth degree polynomial optimization
- On the tensor spectral \(p\)-norm and its dual norm via partitions
- Properties and methods for finding the best rank-one approximation to higher-order tensors
- A hybrid second-order method for homogenous polynomial optimization over unit sphere
- Approximation methods for complex polynomial optimization
This page was built for publication: Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644908)
