A note on semidefinite programming relaxations for polynomial optimization over a single sphere
From MaRDI portal
Publication:341317
DOI10.1007/s11425-016-0301-5zbMath1354.65123OpenAlexW2462530370MaRDI QIDQ341317
Jiang Hu, ZaiWen Wen, Xin Liu, Bo Jiang
Publication date: 16 November 2016
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-016-0301-5
numerical examplesemidefinite programmingBose-Einstein condensatesbest rank-1 tensor approximationpolynomial optimization over a single sphere
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26)
Related Items
Convergence Analysis on SS-HOPM for BEC-Like Nonlinear Eigenvalue Problems, Greedy Approaches to Symmetric Orthogonal Tensor Decomposition, Unnamed Item, A brief introduction to manifold optimization, Computing tensor Z-eigenvalues via shifted inverse power method, Symmetric rank-1 approximation of symmetric high-order tensors, An alternate gradient method for optimization problems with orthogonality constraints, Newton-based methods for finding the positive ground state of Gross-Pitaevskii equations, On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint, Finding the global optimum of a class of quartic minimization problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- Efficient numerical methods for computing ground states of spin-1 Bose-Einstein condensates based on their characterizations
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A regularized Newton method for computing ground states of Bose-Einstein condensates
- Tensor principal component analysis via convex optimization
- Efficient numerical methods for computing ground states and dynamics of dipolar Bose-Einstein condensates
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method
- A New Sobolev Gradient Method for Direct Minimization of the Gross–Pitaevskii Energy with Rotation
- Shifted Power Method for Computing Tensor Eigenpairs
- A Mass and Magnetization Conservative and Energy-Diminishing Numerical Method for Computing Ground State of Spin-1 Bose–Einstein Condensates
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
- Probability Bounds for Polynomial Functions in Random Variables
- The geometric measure of multipartite entanglement and the singular values of a hypermatrix
- Ground States and Dynamics of Spin-Orbit-Coupled Bose--Einstein Condensates
- On Cones of Nonnegative Quadratic Functions
