Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
From MaRDI portal
Publication:644908
DOI10.1007/S10107-011-0464-0zbMATH Open1230.90156OpenAlexW1999276385MaRDI QIDQ644908FDOQ644908
Authors: Anthony Man-Cho So 
Publication date: 7 November 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0464-0
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
Analysis of algorithms (68W40) Nonconvex programming, global optimization (90C26) Approximation algorithms (68W25) Computational aspects related to convexity (52B55) Convex functions and convex programs in convex geometry (52A41)
Cites Work
- Title not available (Why is that?)
- Tensor Decompositions and Applications
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Tensor approximation and signal processing applications
- Eigenvalues of a real supersymmetric tensor
- Global optimization with polynomials and the problem of moments
- Most tensor problems are NP-hard
- Z-eigenvalue methods for a global polynomial optimization problem
- Geometric algorithms and combinatorial optimization.
- Sums of squares, moment matrices and optimization over polynomials
- Title not available (Why is that?)
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Deterministic and randomized polynomial‐time approximation of radii
- Conditions for strong ellipticity of anisotropic elastic materials
- Multiarray signal processing: tensor decomposition meets compressed sensing
- Decoupling inequalities for polynomial chaos
- Conditions for strong ellipticity and M-eigenvalues
- A Unified Theorem on SDP Rank Reduction
- Spectral methods for matrices and tensors
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
- A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- Integration and optimization of multivariate polynomials by restriction onto a random subspace
- Linear Equations Modulo 2 and the $L_1$ Diameter of Convex Bodies
- Singular Value Decompositions and Low Rank Approximations of Tensors
Cited In (34)
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- Approximation methods for complex polynomial optimization
- On the spherical quasi-convexity of quadratic functions on spherically subdual convex sets
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- A hybrid second-order method for homogenous polynomial optimization over unit sphere
- Concepts and techniques of optimization on the sphere
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- Title not available (Why is that?)
- Lower bounds for cubic optimization over the sphere
- Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual
- On solving biquadratic optimization via semidefinite relaxation
- Critical values of multilinear Forms under conic constraints
- On approximation algorithm for orthogonal low-rank tensor approximation
- On the spherical quasi-convexity of quadratic functions
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- On norm compression inequalities for partitioned block tensors
- Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints
- On the tensor spectral \(p\)-norm and its dual norm via partitions
- An efficient alternating minimization method for fourth degree polynomial optimization
- Improved approximation results on standard quartic polynomial optimization
- From the simplex to the sphere: faster constrained optimization using the Hadamard parametrization
- On the spherical convexity of quadratic functions
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Properties and methods for finding the best rank-one approximation to higher-order tensors
- Approximation algorithms for discrete polynomial optimization
- Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
- Semi-definite representations for sets of cubics on the two-dimensional sphere
- Probability bounds for polynomial functions in random variables
- Rank-1 tensor properties with applications to a class of tensor optimization problems
- Bounds on the spectral norm and the nuclear norm of a tensor based on tensor partitions
- Extremal cubics on the circle and the 2-sphere
- On cones of nonnegative quartic forms
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)
