Regularized dual method for nonlinear mathematical programming

For a nonlinear programming problem with equality constraints in a Hilbert space, a dual-type algorithm is constructed that is stable with respect to input data errors. The algorithm is based on a modified dual of the original problem that is solved directly by applying Tikhonov regularization. The algorithm is designed to determine a norm-bounded minimizing sequence of feasible elements. An iterative regularization of the dual algorithm is considered. A stopping rule for the iteration process is given in the case of a finite fixed error in the input data.