Efficiency improvement in an nD systems approach to polynomial optimization

@article{Bleylevens2007EfficiencyII,
  title={Efficiency improvement in an nD systems approach to polynomial optimization},
  author={Ivo W. M. Bleylevens and Ralf L. M. Peeters and Bernard Hanzon},
  journal={J. Symb. Comput.},
  year={2007},
  volume={42},
  pages={30-53}
}
The problem of finding the global minimum of a so-called Minkowski-norm dominated polynomial can be approached by the matrix method of Stetter-Möller, which reformulates it as a large eigenvalue problem. A drawback of this approach is that the matrix involved is usually very large. However, all that is needed for modern iterative eigenproblem solvers (such as methods based on Arnoldi and Jacobi-Davidson techniques) is a routine which computes the action of the matrix on a given vector. The huge… CONTINUE READING