An efficient alternating minimization method for fourth degree polynomial optimization
type: Item
instance of: scholarly article
title: An efficient alternating minimization method for fourth degree polynomial optimization
zbMATH Open document ID: 1481.65088
author: Hongjin He
author: Guanglu Zhou
author: Haibin Chen
author: Yiju Wang
published in: Journal of Global Optimization
publication date: 2022-01-24T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C23
zbMATH DE Number: 7462077
zbMATH Keywords: alternating minimization method
zbMATH Keywords: polynomial optimization
zbMATH Keywords: unit sphere
zbMATH Keywords: bi-quadratic optimization problem
zbMATH Keywords: multi-linear optimization
MaRDI profile type: Publication
full work available at URL: s10898-021-01060-9
OpenAlex ID: W3184526360
cites work: Maximum block improvement and polynomial optimization
cites work: A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test
cites work: Copositivity detection of tensors: theory and algorithm
cites work: Copositive tensor detection and its applications in physics and hypergraphs
cites work: Conditions for strong ellipticity of anisotropic elastic materials
cites work: Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
cites work: Alternating direction method for bi-quadratic programming
cites work: Alternating direction method of multipliers for real and complex polynomial optimization models
cites work: Shifted Power Method for Computing Tensor Eigenpairs
cites work: Global optimization with polynomials and the problem of moments
cites work: Improved approximation results on standard quartic polynomial optimization
cites work: Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
cites work: A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
cites work: An exact Jacobian SDP relaxation for polynomial optimization
cites work: Polynomial optimization with real varieties
cites work: The hierarchy of local minimums in polynomial optimization
cites work: Generating polynomials and symmetric tensor decompositions
cites work: Semidefinite Relaxations for Best Rank-1 Tensor Approximations
cites work: Eigenvalues of a real supersymmetric tensor
cites work: Z-eigenvalue methods for a global polynomial optimization problem
cites work: A unified convergence analysis of block successive minimization methods for nonsmooth optimization
cites work: Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
cites work: On the use of homogeneous polynomials to develop anisotropic yield functions with applications to sheet forming
cites work: Convergence of a block coordinate descent method for nondifferentiable minimization
cites work: A reformulation of the strong ellipticity conditions for unconstrained hyperelastic media
cites work: Convergence analysis of a block improvement method for polynomial optimization over unit spheres
cites work: On solving biquadratic optimization via semidefinite relaxation
cites work: Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
cites work: Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
DOI: 10.1007/S10898-021-01060-9
description: scientific article; zbMATH DE number 7462077