In this work, we study several strategies based on different objective functions for optimization of hexahedral meshes. We consider two approaches to construct objective functions. The first one is based on the decomposition of a hexahedron into tetrahedra. The second one is derived from the Jacobian matrix of the trilinear mapping between the reference and physical hexahedral element. A detailed description of all proposed strategies is given in the present work. Some computational experiments have been developed to test and compare the untangling capabilities of the considered objective functions. In the experiments, a sample of highly distorted hexahedral elements is optimized with the proposed objective functions, and the rate of success of each function is obtained. The results of these experiments are presented and analyzed.Secretaría de Estado de Universidades e Investigación del Ministerio de Economía y Competitividad del Gobierno de España; Programa de FPU del Ministerio de Educación, Cultura y Deporte; Programa de
FPI propio de la ULPGC; Fondos FEDE
