We coin the term augmented penalty method to refer to an augmented Lagrangian-like method in which the penalty parameter is driven to zero instead of being kept bounded away from zero. The spirit of the algorithm is thus that of a classical penalty in which an estimate of the Lagrange multipliers is updated. For the classical augmented Lagrangian function (using the quadratic loss penalty term) applied to equality constrained optimization, Gould (1989 Siam J. Numer. Anal. 26, 107) has obtained a two-step superlinear local convergence result using a constant Lagrange multiplier estimate. Dussault et al have generalized those results to inequality constrained optimization using other penalty terms. On the other hand, convergence and rate of convergence results for augmented Lagrangian methods concern the convergence of the dual variables, usually without relation to the actual effort required to obtain the approximate solutions of the unconstrained primal minimizations. In this paper we consider several updating rules for the Lagrange multiplier estimates and we obtain rate of convergence results for both primal and dual variables, a two-step superlinear convergence of order α, with α < 2. In this result, each iteration uses the solution of a single primal-dual linear system. While this does not improve the rate of convergence of simple penalty methods, it may alleviate some cancellation errors in internal computations.