We study the global optimization problem connected to finding of a minimum of homogeneous quadratic function of a special kind on Stiefel manifold. It's considered Lagrange dual bounds for three variants of this problem ...

In this paper the problem of sample-aided discrete color imagary construction within rectangular field of vision in studied. It is shown that this problem can be reduced to solution of the modulo k residual system of linear ...

An algorithm of constructing two cutting planes localizing the set of solutions to the problem of convex function e-minimum. This algorithm provides for as small as needed angle between cutting planes. It is based on the ...

In the paper there is represented a possible approach to a research and designing of complex systems based on simulation methods and appropriate strategies of optimum solutions searching. On the base of a such approach the ...

Stochastic global minimization problems with objective functions in thc form of mathematical expectation of a minimum function are considered. Ways to construct tangent minorants for such functions are specified. A variant ...

In this paper we explore the problem on decomposition of complete graphs into trees with various amounts of chain-, star-, comet-, and double-star-like vertices. The results of stadies are presented in the form of tables.

We consider and compare two subgradient type methods ("simple' and r-algorithm) for finding lower bounds in branch-and-bound method while solving allocation type problem with new kinds of discounts in the objective function. ...