Abstract
Motivated by nonlinear programming we study a process involving continuous adjustments of both primal and dual variables. Nonsmoothness in problem data or simple restrictions on variables make the velocity of the process possibly nonunique. The process obtained is shown to converge locally under strict monotonicity conditions. Examples are given in terms of augmented Lagrangians. The results are believed to provide a basis for the construction of algorithms.