Piyavskij's method for solving the general global optimization problem
The general global optimization problem with nonlinear constraints (equalities and inequalities) is considered. The author proposes a method of sequential approximation of such a problem by multiextremal problems of special form. The approximated problems are reduced then to concave or dual concave programming problems. Several algorithms for solving auxiliary subproblems are proposed.
scientific article; zbMATH DE number 205004