A stable solution of a nonuniformly perturbed quadratic minimization problem by the extragradient method with step size separated from zero

L. A. Artem'eva ; A. A. Dryazhenkov ; M. M. Potapov

Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 30 (2024) no. 2, pp. 7-22

Résumé

A quadratic minimization problem is considered in Hilbert spaces under constraints given by a linear operator equation and a convex quadratic inequality. The main feature of the problem statement is that the practically available approximations to the exact linear operators specifying the criterion and the constraints converge to them only strongly pointwise rather than in the uniform operator norm, which makes it impossible to justify the use of the classical regularization methods. We propose a regularization method that is applicable in the presence of error estimates for approximate operators in pairs of other operator norms, which are weaker than the original ones. For each of the operators, the pair of corresponding weakened operator norms is obtained by strengthening the norm in the domain of the operator and weakening the norm in its range. The weakening of operator norms usually makes it possible to estimate errors in operators where this was fundamentally impossible in the original norms, for example, in the finite-dimensional approximation of a noncompact operator. From the original optimization formulation, a transition is made to the problem of finding a saddle point of the Lagrange function. The proposed numerical method for finding a saddle point is an iterative regularized extragradient two-stage procedure. At the first stage of each iteration, an approximation to the optimal value of the criterion is refined; at the second stage, the approximate solution with respect to the main variable is refined. Compared to methods previously developed by the authors and working under similar information conditions, this method is preferable for practical implementation, since it does not require the gradient step size to converge to zero. The main result of the work is the proof of the strong convergence of the approximations generated by the method to one of the exact solutions to the original problem in the norm of the original space.

Détail

Keywords: quadratic minimization problem, approximate data, numerical solution, ill-posed problem, regularization, extragradient method, Lagrange function, saddle point.

Bibliographie

[1] Tikhonov A.N., Arsenin V.Ya., Metody resheniya nekorrektnykh zadach, Izd. 3-e, ispr., Nauka, M., 1986, 288 pp.

[2] Goncharskii A.V., Leonov A.S., Yagola A.G., “Ob odnom regulyarizuyuschem algoritme dlya nekorrektno postavlennykh zadach s priblizhenno zadannym operatorom”, Zhurn. vychisl. matematiki i mat. fiziki, 12:6 (1972), 1592–1594

[3] Goncharskii A.V., Leonov A.S., Yagola A.G., “Obobschennyi printsip nevyazki”, Zhurn. vychisl. matematiki i mat. fiziki, 13:2 (1973), 294–302 | MR

[4] Bakushinskii A.B., Goncharskii A.V., Iterativnye metody resheniya nekorrektnykh zadach, Nauka, M., 1989, 128 pp.

[5] Antipin A.S., Artemeva L.A., Vasilev F. P., “Ekstragradientnyi metod poiska resheniya zadachi optimalnogo upravleniya s neyavno zadannymi granichnymi usloviyami”, Zhurn. vychisl. matematiki i mat. fiziki, 57:1 (2017), 49–54 | DOI | Zbl

[6] Zuazua E., “Propagation, observation, and control of waves approximated by finite difference methods”, SIAM Rev., 47:2 (2005), 197–243 | DOI | MR | Zbl

[7] Artemeva L.A., Dryazhenkov A.A., Potapov M.M., “O zadache kvadratichnoi minimizatsii s neravnomernymi vozmuscheniyami v kriterii i ogranicheniyakh”, Tr. In-ta matematiki i mekhaniki UrO RAN, 27:2 (2021), 19–34 | DOI | Zbl

[8] Ekland I., Temam R., Vypuklyi analiz i variatsionnye problemy, Mir, M., 1979, 400 pp. | MR

[9] Vasilev F.P., Metody optimizatsii, V 2-kh kn., MTsNMO, M., 2011, 1053 pp.