A special class of discrete optimization problems that are stated as a minimax modification of
the constraint satisfaction problem is studied. The minimax formulation of the problem …

This paper presents a survey of recent work dealing with the optimization of linear systems
by the methods of functional analysis. The areas covered are: application of the separability …

Optimization Techniques Via The Optimization Toolbox | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your research …

In this paper, we present a general development, called the method of moments, which
allows one to analyze global optimization problems in which the objective function is given …

The present paper is devoted to the application of the space transformation technique for
solving linear and nonlinear programming problems. By using a surjective mapping the …

The solution of the problem of linear programming is solved by means of the method of
functions of fine. It is shown that the coefficient of fine is expedient to choose as the solution …

In the area of broad-band antenna array signal processing, the global minimum of a
quadratic equality constrained quadratic cost minimization problem is often required. The …

Compact algorithms are optimization algorithms belonging to the class of Estimation of
Distribution Algorithms (EDAs). Compact algorithms employ the search logic of population …

This article examines some topics of optimization of computations, which have been
discussed at 25 seminar-schools and symposia organized by the VM Glushkov Institute of …

We shall examine a problem of nonlinear integer optimization in the following
formulation:~(x)--, min, x ER n, xi are integers, i EI n,(1) where x ER n is a strongly convex …