This study presented an upgraded version of the Harris Hawk optimization algorithm (UHHO) designed to overcome the inherent limitations of the original algorithm, especially in solving nonlinear constrained optimization problems that tend to converge prematurely and fall into local optima. First, the initial population generated in a random way was replaced by a good point set strategy. Second, we replaced the linear strategy with a nonlinear strategy in the intermediate stage in order to optimize the global search process. Furthermore, the sine-cosine strategy and L-C cascade chaos strategy were introduced in the development stage to perturb the population's position. This aimed to better explore the neighborhood of Harris Hawk optimal individuals in depth, enhance the local search ability of the algorithm, and avoid the algorithm falling into local optima. Some numerical experiments for solving nonlinear inequality constrained optimization problems are presented at the end of this paper. The simulation results show that the multi-strategy upgraded Harris Hawk algorithm can effectively avoid the problem of the standard Harris Hawk optimization algorithm falling into local optima.