Monotonic complementary problem
Người báo cáo: Đỗ Thị Thùy
Thời gian: 9h00 đến 10h00 sáng thứ Tư ngày 15.10.2025.
Địa điểm: Phòng 508 nhà A6 Viện Toán học
Tóm tắt: We study a general class of nonlinear complementarity problems including the subclass of polynomial ones. As a solution method, we propose an algorithm based on branch-reduce-and-bound paradigm. In contrast to most existing solution methods, our algorithm works under very general conditions. Computational experiments on a benchmark of complementarity problems show the practicability of our solution approach.
Tin tức nổi bật
Hoạt động tuần
Hội thảo sắp diễn ra
03/08/26, Hội nghị, hội thảo:
Summer School "Complex Networks: Theory and Practice" (part 2 of Thematic Semester "GRAPHS AND BEYOND")
13/10/26, Hội nghị, hội thảo:
International Workshop on Optimization, Variational Analysis, and Control Theory
09/11/26, Hội nghị, hội thảo:
Workshop on singularities and related topics (Conference in memory of Professor Lê Dũng Tráng)
Xuất bản mới
Lê Xuân Thanh,
Đỗ Thị Thùy,
Trần Văn Thắng,
Monotonic Complementarity Problems,
Vietnam Journal of Mathematics, Volume 54, pages 999–1011 (2026)
La Văn Thịnh,
Hoàng Thế Tuấn,
On the Mittag–Leffler Stability of Mixed-Order Fractional Homogeneous Cooperative Delay Systems,
Vietnam Journal of Mathematics, Volume 54, pages 773–789 (2026)
Đỗ Minh Thắng,
Sonja Hannibal,
Arnulf Jentzen,
Non-convergence to global minimizers in data driven supervised deep learning: Adam and stochastic gradient descent optimization provably fail to converge to global minimizers in the training of deep neural networks with ReLU activation,
Journal of Mathematical Analysis and Applications, 564 (2026) 130724