Incoherent unit-norm tight frames (IUNTFs) have received considerable attention due to their widespread application. In this paper, the IUNTF design is formulated as a minimization problem of the l(infinity) norm of the difference between the Gram matrix and an identity matrix under the constraints of row orthogonality and column normalization of the frame synthesis operator. A novel numerical method named the coherence-penalty minimization (CPM) algorithm is proposed to attack the constrained coherence-minimization problem. Simulation results demonstrate that the proposed CPM algorithm is more competitive than state-of-the-art algorithms in IUNIF design, especially for high redundancy IUNTF design. (c) 2022 Elsevier B.V. All rights reserved.