The paper studies optimization problems with polynomial objective functions and constraints
in the form of inequalities. We propose a transformation of the solution method based on the …

The paper studies multidimensional optimization problems with a polynomial objective
function and constraints in the form of polynomial matrix inequalities. The author suggests a …

New ways of constructing algorithms for optimal control problems solution on the basis of
special modifications of mathematical programming algorithms are investigated (R …

In this paper, we will give an introductory review on theory, methods and applications of
semi—infinite programming. In part I, linear problems are considered, which form a subclass …

We develop several methods of realization of scalar product and generalized moment
problems. Constructions are made by use of a Hilbertian method or a fixed point method …

Optimization addresses the problem of finding the best possible choices with respect to a
given target, not violating a number of restrictions. In mathematical terms, optimization is the …

Many real-world problems arising in engineering, economics, medicine and other domains
can be formulated as optimization tasks. Every day we solve optimization problems …

An approach is suggested to the solution of problems of optimal control, which relies on the
construction of a sequence of optimized algorithms—a multiple-method procedure of …

Piyavskii's method for solving the general global optimization problem | Computational
Mathematics and Mathematical Physics skip to main content ACM Digital Library home …

AA Vatolin, “On the problems of linear programming with interval coefficients”, Zh. Vychisl. Mat.
Mat. Fiz., 24:11 (1984), 1629–1637; USSR Comput. Math. Math. Phys., 24:6 (1984), 18–23 …