On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian

We study convergence properties of a modified subgradient algorithm, applied to the dual problem by the sharp augmented Lagrangian. The primal problem we consider is nonconvex and nondifferentiable, with equality constraints. We obtain primal and dual convergence results, as well as a condition for existence of a dual solution. Using a practical selection of the step-size parameters, we demonstrate the algorithm and its advantages on test problems, including an integer programming and an optimal control problem.