A new recurrent neural network with noise-tolerance and finite-time convergence for dynamic quadratic minimization

Decomposition based neural dynamics for portfolio management with tradeoffs of risks and profits under transaction costs

Real-time online optimisation plays a crucial role in high-frequency trading (HFT) strategies. The Markowitz model, as a Nobel Prize-winning framework, is widely used for portfolio management optimisation by framing the problem as a constrained quadratic programming task. While conventional analytical methods are typically effective for solving quadratic programming problems with linear constraints, the introduction of both linear equality and inequality constraints in the Markowitz model necessitates the use of numerical methods. The complexity of these numerical solutions presents technical challenges for real-time online optimisation, especially in HFT environments where computational speed and efficiency are critical. To address this challenge, we propose a simplified model that decomposes the problem into analytically solvable and unsolvable components, alongside an innovative dynamic neural network designed to quickly solve the unsolvable components. Overall, this method helps reduce computational load and is well-suited for real-time online computations in HFT settings. Furthermore, we conducted a theoretical analysis and proof of the optimality and global convergence of the solutions obtained using this method. Finally, based on a large set of real stock data, we performed three numerical experiments to validate its effectiveness. Notably, in an experiment using Dow Jones Industrial Average (DJIA) stock data, our approach reduced total costs by 5.54% compared to the commonly used MATLAB quadprog() solver, demonstrating the potential of this method as an efficient tool for portfolio management in HFT scenarios.

A Survey on Biomimetic and Intelligent Algorithms with Applications

The question "How does it work" has motivated many scientists. Through the study of natural phenomena and behaviors, many intelligence algorithms have been proposed to solve various optimization problems. This paper aims to offer an informative guide for researchers who are interested in tackling optimization problems with intelligence algorithms. First, a special neural network was comprehensively discussed, and it was called a zeroing neural network (ZNN). It is especially intended for solving time-varying optimization problems, including origin, basic principles, operation mechanism, model variants, and applications. This paper presents a new classification method based on the performance index of ZNNs. Then, two classic bio-inspired algorithms, a genetic algorithm and a particle swarm algorithm, are outlined as representatives, including their origin, design process, basic principles, and applications. Finally, to emphasize the applicability of intelligence algorithms, three practical domains are introduced, including gene feature extraction, intelligence communication, and the image process.

7-Instant Discrete-Time Synthesis Model Solving Future Different-Level Linear Matrix System via Equivalency of Zeroing Neural Network

Differing from the common linear matrix equation, the future different-level linear matrix system is considered, which is much more interesting and challenging. Because of its complicated structure and future-computation characteristic, traditional methods for static and same-level systems may not be effective on this occasion. For solving this difficult future different-level linear matrix system, the continuous different-level linear matrix system is first considered. On the basis of the zeroing neural network (ZNN), the physical mathematical equivalency is thus proposed, which is called ZNN equivalency (ZE), and it is compared with the traditional concept of mathematical equivalence. Then, on the basis of ZE, the continuous-time synthesis (CTS) model is further developed. To satisfy the future-computation requirement of the future different-level linear matrix system, the 7-instant discrete-time synthesis (DTS) model is further attained by utilizing the high-precision 7-instant Zhang et al. discretization (ZeaD) formula. For a comparison, three different DTS models using three conventional ZeaD formulas are also presented. Meanwhile, the efficacy of the 7-instant DTS model is testified by the theoretical analyses. Finally, experimental results verify the brilliant performance of the 7-instant DTS model in solving the future different-level linear matrix system.

General 7-Instant DCZNN Model Solving Future Different-Level System of Nonlinear Inequality and Linear Equation

In this article, a novel and challenging problem called future different-level system of nonlinear inequality and linear equation (FDLSNILE) is proposed and investigated. To solve FDLSNILE, the corresponding continuous different-level system of nonlinear inequality and linear equation (CDLSNILE) is first analyzed, and then, a continuous combined zeroing neural network (CCZNN) model for solving CDLSNILE is proposed. To obtain a discrete combined zeroing neural network (DCZNN) model for solving FDLSNILE, a high-precision general 7-instant Zhang et al. discretization (ZeaD) formula for the first-order time derivative approximation is proposed. Furthermore, by applying the general 7-instant ZeaD formula to discretize the CCZNN model, a general 7-instant DCZNN (7IDCZNN) model is thus proposed for solving FDLSNILE. For comparison, by using three conventional ZeaD formulas, three conventional DCZNN models are also developed. Meanwhile, theoretical analyses and results guarantee the efficacy and superiority of the general 7IDCZNN model compared with the other three conventional DCZNN models for solving FDLSNILE. Finally, several comparative numerical experiments, including the motion control of a 5-link redundant manipulator, are provided to substantiate the efficacy and superiority of the general 7-instant ZeaD formula and the corresponding 7IDCZNN model.

A new noise-tolerant and predefined-time ZNN model for time-dependent matrix inversion

In this work, a new zeroing neural network (ZNN) using a versatile activation function (VAF) is presented and introduced for solving time-dependent matrix inversion. Unlike existing ZNN models, the proposed ZNN model not only converges to zero within a predefined finite time but also tolerates several noises in solving the time-dependent matrix inversion, and thus called new noise-tolerant ZNN (NNTZNN) model. In addition, the convergence and robustness of this model are mathematically analyzed in detail. Two comparative numerical simulations with different dimensions are used to test the efficiency and superiority of the NNTZNN model to the previous ZNN models using other activation functions. In addition, two practical application examples (i.e., a mobile manipulator and a real Kinova JACO² robot manipulator) are presented to validate the applicability and physical feasibility of the NNTZNN model in a noisy environment. Both simulative and experimental results demonstrate the effectiveness and tolerant-noise ability of the NNTZNN model.