On the stable sequential Lagrange principle in convex programming and its application for solving unstable problems

The convex programming problem in a Hilbert space with an operator equality constraint and a finite number of functional inequality constraints is considered. The Lagrange principle stable with respect to errors in the initial data is proved for this problem in a sequential nondifferential form. The possibility of its application for solving unstable optimization problems and inverse problems is discussed.