On the regularization of the Lagrange principle and on the construction of the generalized minimizing sequences in convex constrained optimization problems

We consider the regularization of the Lagrange principle (LP) in the convex constrained optimization problem with operator constraint-equality in a Hilbert space and with a finite number of functional inequality-constraints. The objective functional of the problem is not, generally speaking, strongly convex. The set of admissible elements of the problem is also embedded into a Hilbert space and is not assumed to be bounded. Obtaining a regularized LP is based on the dual regularization method and involves the use of two regularization parameters and two corresponding matching conditions at the same time. One of the regularization parameters is «responsible» for the regularization of the dual problem, while the other is contained in a strongly convex regularizing addition to the objective functional of the original problem. The main purpose of the regularized LP is the stable generation of generalized minimizing sequences that approximate the exact solution of the problem by function and by constraint, for the purpose of its practical stable solving.