We propose an efficient method for solving polynomial optimization and tensor optimization problems.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 that achieves the maximum improvement,hence the name of our new search method: maximum block improvement (MBI).Convergence of the sequence produced by the MBI method to a stationary point is proved.