Minimization of multiextremal functions under nonconvex constraints

Yu. G. Evtushenko, ?Numerical method for seeking global extremum of function (inspection on nonuniform mesh),? Zh. Vychisl. Mat. Mat. Fiz.,11, No. 6, 1390?1403 (1971).

V. V. Ivanov, ?Optimal algorithms for minimization of functions of certain classes,? Kibernetika, No. 4, 81?94 (1972).

A. G. Zhilinskas and I. B. Motskus, ?On a Bayes method of minimum search,? Avtomat. Vyschisl. Tekh., No. 4, 42?44 (1972).

A. N. Babii, ?Algorithm for finding global extremum values of functions of several variables with given accuracy,? Kibernetika, No. 5, 52?56 (1978).

R. G. Strongin, Numerical Methods in Multiextremal Problems [in Russian], Nauka, Moscow (1978).

A. G. Sukharev, ?Global extremum and methods of finding it,? Mathematical Methods of Operations Research [in Russian], Izd. Mosk. Univ., Moscow, 4?36 (1981).

A. V. Fiacco and G. P. McCormick, Nonlinear Programming, Wiley (1968).

I. I. Eremin, ?Method of penalties in convex programming,? Kibernetika, No. 4, 63?67 (1967).

R. G. Strongin, ?Numerical Methods of Nonlinear programming,? Int. Wiss. Koll. TH Ilmenau,27, 59?61 (1982).

R. G. Strongin and V. A. Grishagin, ?Multiextremal minimization under unimodal constraints,? Modelling and optimization of Planning Decisions in SAPR; Abstracts of papers to 5th all-union session on automation of design of electrical circuits [in Russian], Part 2, Izd. Inst. Kibern., Akad. Nauk ESSR, Tallin (1983), pp. 100?102.

D. J. Wilde, Optimum Seeking Methods, Prentice-Hall (1964).

R. G. Strongin and V. P. Gergel', ?On computer realization of multidimensional generalized algorithm of global search,? Vopr. Kibern., No. 45, 59?66 (1978).