All issues

We consider a finite-dimensional optimization problem, the formulation of which in addition to the required variables contains parameters. The solution to this problem is a dependence of optimal values of variables on parameters. In general, these dependencies are not functions because they can have ambiguous meanings and in the functional case be nondifferentiable. In addition, their domain of definition may be narrower than the domains of definition of functions in the condition of the original problem. All these properties make it difficult to solve both the original parametric problem and other tasks, the statement of which includes these dependencies. To overcome these difficulties, usually methods such as non-differentiable optimization are used.

This article proposes an alternative approach that makes it possible to obtain solutions to parametric problems in a form devoid of the specified properties. It is shown that such representations can be explored using standard algorithms, based on the Taylor formula. This form is a function smoothly approximating the solution of the original problem for any parameter values, specified in its statement. In this case, the value of the approximation error is controlled by a special parameter. Construction of proposed approximations is performed using special functions that establish feedback (within optimality conditions for the original problem) between variables and Lagrange multipliers. This method is described for linear problems with subsequent generalization to the nonlinear case.

From a computational point of view the construction of the approximation consists in finding the saddle point of the modified Lagrange function of the original problem. Moreover, this modification is performed in a special way using feedback functions. It is shown that the necessary conditions for the existence of such a saddle point are similar to the conditions of the Karush – Kuhn – Tucker theorem, but do not contain constraints such as inequalities and conditions of complementary slackness. Necessary conditions for the existence of a saddle point determine this approximation implicitly. Therefore, to calculate its differential characteristics, the implicit function theorem is used. The same theorem is used to reduce the approximation error to an acceptable level.

Features of the practical implementation feedback function method, including estimates of the rate of convergence to the exact solution are demonstrated for several specific classes of parametric optimization problems. Specifically, tasks searching for the global extremum of functions of many variables and the problem of multiple extremum (maximin-minimax) are considered. Optimization problems that arise when using multicriteria mathematical models are also considered. For each of these classes, there are demo examples.

Conjugate gradient algorithms represent an important class of unconstrained optimization algorithms with strong local and global convergence properties and simple memory requirements. These algorithms have advantages that place them between the steep regression method and Newton’s algorithm because they require calculating the first derivatives only and do not require calculating and storing the second derivatives that Newton’s algorithm needs. They are also faster than the steep descent algorithm, meaning that they have overcome the slow convergence of this algorithm, and it does not need to calculate the Hessian matrix or any of its approximations, so it is widely used in optimization applications. This study proposes a novel method for image restoration by fusing the convex combination method with the hybrid (CG) method to create a hybrid three-term (CG) algorithm. Combining the features of both the Fletcher and Revees (FR) conjugate parameter and the hybrid Fletcher and Revees (FR), we get the search direction conjugate parameter. The search direction is the result of concatenating the gradient direction, the previous search direction, and the gradient from the previous iteration. We have shown that the new algorithm possesses the properties of global convergence and descent when using an inexact search line, relying on the standard Wolfe conditions, and using some assumptions. To guarantee the effectiveness of the suggested algorithm and processing image restoration problems. The numerical results of the new algorithm show high efficiency and accuracy in image restoration and speed of convergence when used in image restoration problems compared to Fletcher and Revees (FR) and three-term Fletcher and Revees (TTFR).

The technique of simplification of mathematical model of a chemical reaction by reducing the number of steps of the reaction scheme, based on an analysis of sensitivity to changes in the objective function of the model parameters, is proposed. The reduced scheme of model reaction of formaldehyde oxidation is received. Functional characterizes the measure of proximity to the calculated values for the initial kinetic reaction scheme and the scheme resulting disturbance of its parameters. The advantage of this technique is the ability to analyze complex kinetic schemes and reduction of kinetic models to a size suitable for practical use. The results of computational experiments under different reaction conditions can be included in the functional and thus to receive the reduce scheme, which is consistent the detailed scheme for the desired range of conditions. Sensitivity analysis of the functional model allows to identify those parameters, which provide the largest (or smallest) the contribution to the result of the process simulation. The mathematical model can contain parameters, which change of values do not affect the qualitative and quantitative description of the process. The contribution of these parameters in the functional value won’t be of great importance. Thus it can be eliminated from consideration, which do not serve for modeling kinetic curves substances. The kinetic scheme of formaldehyde oxidation, the detailed mechanism which includes 25 stages and 15 substances, were investigated using this method. On the basis of the local and global sensitivity analysis, the most important stage of the process that affect the overall dynamics of the target concentrations of the reaction. The reduced scheme of model reaction of formaldehyde oxidation is received. This scheme also describes the behavior of the main substances, as detailed scheme, but has a much smaller number of reaction stages. The results of the comparative analysis of modeling of formaldehyde oxidation on detailed and reduced schemes are given. Computational aspects of the problems of chemical kinetics by Sobol’ global method an example of this reaction are specified. The comparison results are local, global and total sensitivity indices are given.

In this paper we discuss lower bounds for convergence of convex optimization methods of high order and attainability of this bounds. We formulate a hypothesis that covers all the cases. It is noticeable that we provide this statement without a proof. Newton method is the most famous method that uses gradient and Hessian of optimized function. However, it converges locally even for strongly convex functions. Global convergence can be achieved with cubic regularization of Newton method [Nesterov, Polyak, 2006], whose iteration cost is comparable with iteration cost of Newton method and is equivalent to inversion of Hessian of optimized function. Yu.Nesterov proposed accelerated variant of Newton method with cubic regularization in 2008 [Nesterov, 2008]. R.Monteiro and B. Svaiter managed to improve global convergence of cubic regularized method in 2013 [Monteiro, Svaiter, 2013]. Y.Arjevani, O. Shamir and R. Shiff showed that convergence bound of Monteiro and Svaiter is optimal (cannot be improved by more than logarithmic factor with any second order method) in 2017 [Arjevani et al., 2017]. They also managed to find bounds for convex optimization methods of p-th order for $p ≥ 2$. However, they got bounds only for first and second order methods for strongly convex functions. In 2018 Yu.Nesterov proposed third order convex optimization methods with rate of convergence that is close to this lower bounds and with similar to Newton method cost of iteration [Nesterov, 2018]. Consequently, it was showed that high order methods can be practical. In this paper we formulate lower bounds for p-th order methods for $p ≥ 3$ for strongly convex unconstrained optimization problems. This paper can be viewed as a little survey of state of the art of high order optimization methods.

Finding the global minimum of a nonconvex function is one of the key and most difficult problems of the modern optimization. In this paper we consider special classes of nonconvex problems which have a clear and distinct global minimum.

In the first part of the paper we consider two classes of «good» nonconvex functions, which can be bounded below and above by a parabolic function. This class of problems has not been widely studied in the literature, although it is rather interesting from an applied point of view. Moreover, for such problems first-order and higher-order methods may be completely ineffective in finding a global minimum. This is due to the fact that the function may oscillate heavily or may be very noisy. Therefore, our new methods use only zero-order information and are based on grid search. The size and fineness of this grid, and hence the guarantee of convergence speed and oracle complexity, depend on the «goodness» of the problem. In particular, we show that if the function is bounded by fairly close parabolic functions, then the complexity is independent of the dimension of the problem. We show that our new methods converge with a linear convergence rate $\log(1/\varepsilon)$ to a global minimum on the cube.

In the second part of the paper, we consider the nonconvex optimization problem from a different angle. We assume that the target minimizing function is the sum of the convex quadratic problem and a nonconvex «noise» function proportional to the distance to the global solution. Considering functions with such noise assumptions for zero-order methods is new in the literature. For such a problem, we use the classical gradient-free approach with gradient approximation through finite differences. We show how the convergence analysis for our problems can be reduced to the standard analysis for convex optimization problems. In particular, we achieve a linear convergence rate for such problems as well.

Experimental results confirm the efficiency and practical applicability of all the obtained methods.

The transfer of Big Data over computer network is important and unavoidable operation in the past, now and in any feasible future. There are a number of methods to transfer the data over computer global network (Internet) with a range of tools. In this paper the transfer of one piece of Big Data from one point in the Internet to another point in Internet in general over long range distance: many thousands kilometers. Several free of charge systems to transfer the Big Data are analyzed here. The most important architecture features are emphasized and suggested idea to add SDN Openflow protocol technique for fine tuning the data transfer over several parallel data links.

The paper is devoted to the analysis of the proximity of the population system to dangerous boundaries. An intersection of these boundaries results in the collapse of the stable coexistence of interacting populations. As a reason of such destruction one can consider random perturbations inevitably presented in any living system. This study is carried out on the example of the well-known model of interaction between predator and prey populations, taking into account both a stabilizing factor of the competition of predators for another than prey resources, and also a destabilizing saturation factor for predators. To describe the saturation of predators, we use the second type Holling trophic function. The dynamics of the system is studied as a function of the predator saturation, and the coefficient of predator competition for resources other than prey. The paper presents a parametric description of the possible dynamic regimes of the deterministic model. Here, local and global bifurcations are studied, and areas of sustainable coexistence of populations in equilibrium and the oscillation modes are described. An interesting feature of this mathematical model, firstly considered by Bazykin, is a global bifurcation of the birth of limit cycle from the separatrix loop. We study the effects of noise on the equilibrium and oscillatory regimes of coexistence of predator and prey populations. It is shown that an increase of the intensity of random disturbances can lead to significant deformations of these regimes right up to their destruction. The aim of this work is to develop a constructive probabilistic criterion for the proximity of the population stochastic system to the dangerous boundaries. The proposed approach is based on the mathematical technique of stochastic sensitivity functions, and the method of confidence domains. In the case of a stable equilibrium, this confidence domain is an ellipse. For the stable cycle, this domain is a confidence band. The size of the confidence domain is proportional to the intensity of the noise and stochastic sensitivity of the initial deterministic attractor. A geometric criterion of the exit of the population system from sustainable coexistence mode is the intersection of the confidence domain and the corresponding separatrix of the unforced deterministic model. An effectiveness of this analytical approach is confirmed by the good agreement of theoretical estimates and results of direct numerical simulations.

The present article sets out the scientific approach of Dmitry Sergeevich Chernavskii to the modelling of economic processes. It recounts the history of works of Dmitry Sergeyevich on the economic front, its milestones and achievements. One of the most important advances in the economic analysis was the prediction by a team of scientists headed by D. S. Chernavskii, the major crises that have occurred in our country over the last 20 years, namely, the default of 1998, the crisis of industrial production in the second half of the 2000s, the 2008 crisis and the ensuing recession. As an example, the dynamic analysis of the global macroeconomic processes shows the model of functioning of the dollar as the world currency. On this particular example shows the possibility of seigniorage due to the issue of the dollar and the calculated “window of opportunity” that allows you to issue dollars as the global currency, without prejudice to its own economy.

A model for the development of a closed society (without external economic relations) in the one-product approach is considered as an example of dynamic analysis of the economy of a separate state. The model is based on the principles of market economy, i.e. the dynamics of prices is determined by the balance of supply and demand. It is shown that in the general case, the state of market equilibrium is not unique. Several steady states with different levels of production and consumption are possible. Effect of addressed emission of money in underproductive state is considered. It is shown that, depending on its size it can lead to the transition to a highly productive condition, and just cause inflation without transition. The relationship of these results with the “Keynesian” and “monetarist” approaches is discussed.

In this article, a meshfree-spectral method for numerical investigation of dynamics of planar geophysical flows is proposed. We investigate inviscid incompressible fluid flows with the presence of planetary rotation. Mathematically this problem is described by the non-steady system of two partial differential equations in terms of stream and vorticity functions with different boundary conditions (closed flow region and periodic conditions). The proposed method is based on several assumptions. First of all, the vorticity field is given by its values on the set of particles. The function of vorticity distribution is approximated by piecewise cubic polynomials. Coefficients of polynomials are found by least squares method. The stream function is calculated by using the spectral global Bubnov –Galerkin method at each time step.

The dynamics of fluid particles is calculated by pseudo-symplectic Runge –Kutta method. A detailed version of the method for periodic boundary conditions is described in this article for the first time. The adequacy of numerical scheme was examined on test examples. The dynamics of the configuration of four identical circular vortex patches with constant vorticity located at the vertices of a square with a center at the pole is investigated by numerical experiments. The effect of planetary rotation and the radius of patches on the dynamics and formation of vortex structures is studied. It is shown that, depending on the direction of rotation, the Coriolis force can enhance or slow down the processes of interaction and mixing of the distributed vortices. At large radii the vortex structure does not stabilize.