An efficient alternating minimization method for fourth degree polynomial optimization
From MaRDI portal
Publication:2070363
DOI10.1007/s10898-021-01060-9zbMath1481.65088OpenAlexW3184526360MaRDI QIDQ2070363
Guanglu Zhou, Hongjin He, Hai-Bin Chen, Y. J. Wang
Publication date: 24 January 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01060-9
unit spherepolynomial optimizationalternating minimization methodbi-quadratic optimization problemmulti-linear optimization
Related Items (3)
Shifted inverse power method for computing the smallest M-eigenvalue of a fourth-order partially symmetric tensor ⋮ An alternating shifted inverse power method for the extremal eigenvalues of fourth-order partially symmetric tensors ⋮ Parameterized S-type M-eigenvalue inclusion intervals for fourth-order partially symmetric tensors and its applications
Cites Work
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Alternating direction method for bi-quadratic programming
- Copositive tensor detection and its applications in physics and hypergraphs
- Z-eigenvalue methods for a global polynomial optimization problem
- Conditions for strong ellipticity of anisotropic elastic materials
- A reformulation of the strong ellipticity conditions for unconstrained hyperelastic media
- Copositivity detection of tensors: theory and algorithm
- Improved approximation results on standard quartic polynomial optimization
- On solving biquadratic optimization via semidefinite relaxation
- An exact Jacobian SDP relaxation for polynomial optimization
- The hierarchy of local minimums in polynomial optimization
- Generating polynomials and symmetric tensor decompositions
- On the use of homogeneous polynomials to develop anisotropic yield functions with applications to sheet forming
- Eigenvalues of a real supersymmetric tensor
- Global Optimization with Polynomials and the Problem of Moments
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- Polynomial Optimization with Real Varieties
- Maximum Block Improvement and Polynomial Optimization
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
- Shifted Power Method for Computing Tensor Eigenpairs
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test
- Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
- Alternating direction method of multipliers for real and complex polynomial optimization models
- Convergence analysis of a block improvement method for polynomial optimization over unit spheres
- Convergence of a block coordinate descent method for nondifferentiable minimization
This page was built for publication: An efficient alternating minimization method for fourth degree polynomial optimization
