A hybrid second-order method for homogenous polynomial optimization over unit sphere
type: Item
instance of: scholarly article
title: A hybrid second-order method for homogenous polynomial optimization over unit sphere
zbMATH Open document ID: 1371.65036
author: Guanglu Zhou
author: Yiju Wang
published in: Journal of the Operations Research Society of China
publication date: 2017-08-25T00:00:00Z
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 6764695
zbMATH Keywords: homogenous polynomial
zbMATH Keywords: numerical examples
zbMATH Keywords: trust region method
zbMATH Keywords: eigenvalue problem
zbMATH Keywords: hybrid second-order method
zbMATH Keywords: shifted power method
MaRDI profile type: Publication
full work available at URL: s40305-016-0148-9
OpenAlex ID: W2573411316
cites work: On the best rank-1 approximation of higher-order supersymmetric tensors
cites work: Maximum block improvement and polynomial optimization
cites work: Probability Bounds for Polynomial Functions in Random Variables
cites work: Alternating direction method of multipliers for real and complex polynomial optimization models
cites work: Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
cites work: Positive semidefinite generalized diffusion tensor imaging via quadratic semidefinite programming
cites work: Tensor principal component analysis via convex optimization
cites work: A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
cites work: Q5402630
cites work: An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
cites work: Eigenvalues of a real supersymmetric tensor
cites work: Shifted Power Method for Computing Tensor Eigenpairs
cites work: Z-eigenvalue methods for a global polynomial optimization problem
cites work: Global optimization with polynomials and the problem of moments
cites work: Semidefinite Relaxations for Best Rank-1 Tensor Approximations
cites work: A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors
cites work: An adaptive gradient method for computing generalized tensor eigenpairs
cites work: Q3151174
cites work: Q2941671
cites work: Q5689624
DOI: 10.1007/S40305-016-0148-9
description: scientific article; zbMATH DE number 6764695