Maximum Block Improvement and Polynomial Optimization
Maximum Block Improvement and Polynomial Optimization
In this paper we propose an efficient method for solving the spherically constrained homogeneous polynomial optimization problem. The new approach has the following three main ingredients. First, we establish a block coordinate descent type search method for nonlinear optimization, with the novelty being that we accept only a block update …