A hybrid second-order method for homogenous polynomial optimization over unit sphere
From MaRDI portal
Publication:2014677
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
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A feasible trust-region method for calculating extreme \(Z\)-eigenvalues of symmetric tensors
- A practical method for computing the largest \(M\)-eigenvalue of a fourth-order partially symmetric tensor
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- Alternating direction method of multipliers for real and complex polynomial optimization models
- An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
- An adaptive gradient method for computing generalized tensor eigenpairs
- An alternative steepest direction method for the optimization in evaluating geometric discord
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Eigenvalues of a real supersymmetric tensor
- Global optimization with polynomials and the problem of moments
- Maximum block improvement and polynomial optimization
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Positive semidefinite generalized diffusion tensor imaging via quadratic semidefinite programming
- Probability bounds for polynomial functions in random variables
- Semidefinite relaxations for best rank-1 tensor approximations
- Shifted power method for computing tensor eigenpairs
- Tensor principal component analysis via convex optimization
- Z-eigenvalue methods for a global polynomial optimization problem
Cited in
(5)- Maximum block improvement and polynomial optimization
- Convergence analysis of a block improvement method for polynomial optimization over unit spheres.
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- A global optimization algorithm for a type of homogeneous polynomial optimization
- 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)
