A hybrid second-order method for homogenous polynomial optimization over unit sphere

DOI10.1007/S40305-016-0148-9zbMATH Open1371.65036OpenAlexW2573411316MaRDI QIDQ2014677FDOQ2014677

Guanglu Zhou, Yiju Wang

Publication date: 25 August 2017

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-016-0148-9

Recommendations

• A global optimization algorithm for a type of homogeneous polynomial optimization
• Convergence analysis of a block improvement method for polynomial optimization over unit spheres.
• Maximum block improvement and polynomial optimization
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
• Homogeneous polynomials and spurious local minima on the unit sphere

zbMATH Keywords

numerical exampleseigenvalue problemtrust region methodhomogenous polynomialhybrid second-order methodshifted power method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Interior-point methods (90C51)

Cites Work

• Title not available (Why is that?)
• Maximum block improvement and polynomial optimization
• Tensor principal component analysis via convex optimization
• Eigenvalues of a real supersymmetric tensor
• Global optimization with polynomials and the problem of moments
• Title not available (Why is that?)
• Z-eigenvalue methods for a global polynomial optimization problem
• On the best rank-1 approximation of higher-order supersymmetric tensors
• A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
• Shifted Power Method for Computing Tensor Eigenpairs
• An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
• Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
• Positive semidefinite generalized diffusion tensor imaging via quadratic semidefinite programming
• Semidefinite Relaxations for Best Rank-1 Tensor Approximations
• Probability Bounds for Polynomial Functions in Random Variables
• An adaptive gradient method for computing generalized tensor eigenpairs
• A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors
• Alternating direction method of multipliers for real and complex polynomial optimization models
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Globally maximizing the sum of squares of quadratic forms over the unit sphere
• Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems

This page was built for publication: A hybrid second-order method for homogenous polynomial optimization over unit sphere

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014677)