Владимир Николаевич Крутиков

Prof. Владимир Николаевич Крутиков

orcid

Research Focus & Metrics

Academic Career Length

44Years (1983-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2019 in Automation and Remote Control
Verified
Journal Article
Closed access
PDF file
ВКВладимир Николаевич Крутиков
Владимир Николаевич Крутиков
NSN. S. Samoilenko
N. S. Samoilenko
VMV. V. Meshechkin
V. V. Meshechkin
We present a subgradient method of minimization, similar to the method of minimal iterations for solving systems of equations, which inherits from the latter convergence properties on quadratic...

21 November 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
ВКВладимир Николаевич Крутиков
Владимир Николаевич Крутиков
ETElena Tovbis
Elena Tovbis
Predrag S. StanimirovicPredrag S. Stanimirovic
Predrag S. Stanimirovic
LKLev Kazakovtsev
Lev Kazakovtsev
The main results of the study of the convergence rate of quasi-Newton minimization methods were obtained under the assumption that the method operates in the region of the extremum of the function, where there is a stable quadratic representation of the function. Methods based on the quadratic model of the function in the extremum area show significant advantages over classical gradient methods. When solving a specific problem using the quasi-Newton method, a huge number of iterations occur outside the extremum area, unless there is a stable quadratic approximation of the function. In this paper, we study the convergence rate of quasi-Newton-type methods on strongly convex functions with a Lipschitz gradient, without using local quadratic approximations of a function based on the properties of its Hessian. We proved that quasi-Newton methods converge on strongly convex functions with a Lipschitz gradient with the rate of a geometric progression, while the estimate of the convergence rate improves with the increasing number of iterations, which reflects the fact that the learning (adaptation) effect accumulates as the method operates. Another important fact discovered during the theoretical study is the ability of quasi-Newton methods to eliminate the background that slows down the convergence rate. This elimination is achieved through a certain linear transformation that normalizes the elongation of function level surfaces in different directions. All studies were carried out without any assumptions regarding the matrix of second derivatives of the function being minimized.

25 October 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
ВКВладимир Николаевич Крутиков
Владимир Николаевич Крутиков
SGSvetlana Gutova
Svetlana Gutova
ETElena Tovbis
Elena Tovbis
LKLev Kazakovtsev
Lev Kazakovtsev
Eugene SemenkinEugene Semenkin
Eugene Semenkin
In the modern digital economy, optimal decision support systems, as well as machine learning systems, are becoming an integral part of production processes. Artificial neural network training as well as other engineering problems generate such problems of high dimension that are difficult to solve with traditional gradient or conjugate gradient methods. Relaxation subgradient minimization methods (RSMMs) construct a descent direction that forms an obtuse angle with all subgradients of the current minimum neighborhood, which reduces to the problem of solving systems of inequalities. Having formalized the model and taking into account the specific features of subgradient sets, we reduced the problem of solving a system of inequalities to an approximation problem and obtained an efficient rapidly converging iterative learning algorithm for finding the direction of descent, conceptually similar to the iterative least squares method. The new algorithm is theoretically substantiated, and an estimate of its convergence rate is obtained depending on the parameters of the subgradient set. On this basis, we have developed and substantiated a new RSMM, which has the properties of the conjugate gradient method on quadratic functions. We have developed a practically realizable version of the minimization algorithm that uses a rough one-dimensional search. A computational experiment on complex functions in a space of high dimension confirms the effectiveness of the proposed algorithm. In the problems of training neural network models, where it is required to remove insignificant variables or neurons using methods such as the Tibshirani LASSO, our new algorithm outperforms known methods.

27 December 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
ВКВладимир Николаевич Крутиков
Владимир Николаевич Крутиков
ETElena Tovbis
Elena Tovbis
SGSvetlana Gutova
Svetlana Gutova
IRIvan Rozhnov
Ivan Rozhnov
LKLev Kazakovtsev
Lev Kazakovtsev
The paper solves the problem of constructing step adjustment algorithms for a gradient method based on the principle of the steepest descent. The expansion of the step adjustment principle, its formalization and parameterization led the researchers to gradient-type methods with incomplete relaxation or over-relaxation. Such methods require only the gradient of the function to be calculated at the iteration. Optimization of the parameters of the step adaptation algorithms enables us to obtain methods that significantly exceed the steepest descent method in terms of convergence rate. In this paper, we present a universal step adjustment algorithm that does not require selecting optimal parameters. The algorithm is based on orthogonality of successive gradients and replacing complete relaxation with some degree of incomplete relaxation or over-relaxation. Its convergence rate corresponds to algorithms with optimization of the step adaptation algorithm parameters. In our experiments, on average, the proposed algorithm outperforms the steepest descent method by 2.7 times in the number of iterations. The advantage of the proposed methods is their operability under interference conditions. Our paper presents examples of solving test problems in which the interference values are uniformly distributed vectors in a ball with a radius 8 times greater than the gradient norm.

1 January 1983 in USSR Computational Mathematics and Mathematical Physics
Verified
Journal Article
Closed access
ВКВладимир Николаевич Крутиков
Владимир Николаевич Крутиков

16 November 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
Predrag S. StanimirovicPredrag S. Stanimirovic
Predrag S. Stanimirovic
Spyridon D. MourtasSpyridon D. Mourtas
Spyridon D. Mourtas
Vasilios N. KatsikisVasilios N. Katsikis
Vasilios N. Katsikis
LKLev Kazakovtsev
Lev Kazakovtsev
ВКВладимир Николаевич Крутиков
Владимир Николаевич Крутиков
Many researchers have addressed problems involving time-varying (TV) general linear matrix equations (GLMEs) because of their importance in science and engineering. This research discusses and solves the topic of solving TV GLME using the zeroing neural network (ZNN) design. Five new ZNN models based on novel error functions arising from gradient-descent and Newton optimization methods are presented and compared to each other and to the standard ZNN design. Pseudoinversion is involved in four proposed ZNN models, while three of them are related to Newton’s optimization method. Heterogeneous numerical examples show that all models successfully solve TV GLMEs, although their effectiveness varies and depends on the input matrix.