.- 1 On Solving Difficult Combinatorial Optimization Problems Efficiently— A New Framework.- Variants of inertial algorithms for nonmonotone equilibrium problems.- Recovering Linear Causal Models with Latent Variables via Cholesky Factorization of Covariance Matrix.- Computing sparse generalized inverses for least-squares.- Dynamic Regret for Online Proximal Newton’s Method, etc.

This proceeding set contains 81 selected full papers presented at the International Conference on Applied Mathematics and Computer Science (ICAMCS 2024), which was held on December 20-21, 2024 in Hanoi, Vietnam, in honor of Professors Pham Dinh Tao and Le Thi Hoai An for the 40th birthday of DC (Difference of Convex functions) programming and DCA (DC Algorithm). The book covers theoretical and algorithmic as well as practical issues connected with several domains of Applied Mathematics and Computer Science, especially Optimization and Data Science. The present part I of the 2-volume set includes articles devoted to Mathematical programming and optimization, DC Programming & DCA, Operations research and decision making, Economics & Finance, Engineering Systems, Autonomous systems, Information theory and Information security. Researchers and practitioners in related areas will find a wealth of inspiring ideas and useful tools and techniques for their own work.