Abstract
Coordinated parameters for iterative regularization of the penalty method with infinitely many constraints are derived. A regularization algorithm for the mixed penalty and (stochastic) quasigradient method is considered.
Similar content being viewed by others
Literature Cited
Yu. B. Germeier, Introduction to Operations Research Theory [in Russian], Nauka, Moscow (1971).
V. V. Fedorov, Numerical Maximin Methods [in Russian], Nauka, Moscow (1979).
F. P. Vasil'ev, Methods of Solution of Extremal Problems [in Russian], Nauka, Moscow (1981).
V. G. Karmanov, Mathematical Programming [in Russian], Nauka, Moscow (1986).
A. N. Tikhonov and V. Ya. Arsenin, Methods of Solution of Ill-Posed Problems [in Russian], Nauka, Moscow (1974).
Yu. M. Ermol'ev, Stochastic Programming Methods [in Russian], Nauka, Moscow (1976).
N. M. Novikova, “Stochastic quasigradient minimax-seeking method”, Zh. Vychisl. Mat. Mat. Fiz.,17, No. 1, 91–99 (1977).
J. L. Doob, Stochastic Processes, Wiley-Interscience, NY (1953).
M. T. Wasan, Stochastic Approximation, Cambridge Univ. Press (1969).
N. M. Novikova, “Penalty method in maximin-seeking problem with coupled variables”, in: Mathematical Methods of Operations Research [in Russian], Izd. Mosk. Gos. Univ., Moscow (1981), pp. 83–91.
S. K. Zavriev, Stochastic Gradient Methods for Solving Minimax Problems [in Russian], Izd. Mosk. Gos. Univ., Moscow (1984).
A. B. Bakushinskii and B. T. Polyak, “On solving variational inequalities”, Dokl. Akad. Nauk SSSR,219, No. 5, 1038–1041 (1974).
Additional information
Translated from Kibernetika, No. 1, pp. 86–89, January–February, 1991.
Rights and permissions
About this article
Cite this article
Novikova, N.M. Iterative regularization for semiinfinite optimization problems. Cybern Syst Anal 27, 115–120 (1991). https://doi.org/10.1007/BF01068654
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068654