MATHEMATICAL OPTIMIZATION OF ARTIFICIAL INTELLIGENCE ALGORITHMS

Authors

  • O.M. Mamalatipov Author

Keywords:

mathematical optimization, artificial intelligence, gradient descent, machine learning algorithms, neural network training, stochastic optimization, convex and non-convex optimization, hyperparameter tuning.

Abstract

Artificial intelligence (AI) algorithms, particularly those underlying machine learning and deep learning models, fundamentally rely on mathematical optimization to achieve accurate and efficient performance. This article reviews the mathematical foundations and modern techniques used to optimize AI algorithms, with emphasis on gradient-based methods, second-order optimization techniques, stochastic and evolutionary approaches, and hybrid optimization strategies. This review aims to provide researchers and practitioners with a structured understanding of the mathematical optimization landscape underlying contemporary AI systems and to highlight emerging directions for further research.

References

1.Liu, D. C., & Nocedal, J. (1989). On the limited memory BFGS method for large scale optimization. Mathematical Programming, 45(1–3), 503–528.

2.Nesterov, Y. (1983). A method for solving the convex programming problem with convergence rate O(1/k²). Doklady Akademii Nauk SSSR, 269, 543–547.

3.Mamalatipov O., Shahobiddin K. STAGNATION IN THE RITZ AND GALYORKIN METHODS //International Bulletin of Engineering and Technology. – 2023. – Т. 3. – №. 5. – С. 17-22.

4.Yo‘ldoshaliyev A. S., Mamalatipov O. M. STRUCTURAL GEOLOGY AND TECTONICS //Journal of Universal Science Research. – 2024. – Т. 2. – №. 1. – С. 50-59

Downloads

Published

2026-08-10