On a local and global search involved in nonconvex optimization problems

A new approach to the solution of nonconvex problems of optimal control and mathematical programming is treated, which rests on the theory of global optimality conditions (GOC). Moreover, attention is given to the development and investigation of special methods of local search and to investigation of the convergence of strategies of global search, which rely on the GOCs, and also to a comparable numerical experiment.

Presented by the member of Editorial Board: A. I. Kibzun