Regularization of compactly solvable problems

Publication date 19 September 2001

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

incorrect problems minimax problems regularization methods

Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear programming (90C05) Minimax problems in mathematical programming (90C47)

Review text

Many methods of regularization are used by solving the linear of nonlinear equations, inequalities, the equations of linear programming and general extremal problems. A. N. Tikhonov in 1980 is proposed a new method of regularization for the system of linear equations according to which a solution of the initial incorrect problem substitutes by a minimization of stabilizing functional on an unit set of solutions of all problems of that type with data equivalent in respect to data accuracy of the initial problem. The analogous approach was proposed by the author for nonlinear equations and inequalities which have permissible sets continuously depended on initial data. This approach is generalized now for a new class of incorrect compact solvable extremal problems.

Recommendations

Cited in

(5)

This page was built for publication: Regularization of compactly solvable problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5942498)