Euclidean Distance Degree of Curves in C^3
Người báo cáo: Phạm Thu Thúy
Thời gian: 09h00, thứ năm, ngày 23/2/2023.
Địa điểm: Phòng 507, nhà A6.
Tóm tắt: The Euclidean distance degree (ED degree) of a variety X is the number of critical points of the distance function from a general point outside of X. It concerns some problems such as computer vision, nearest point problems in engineering, ... . In this talk, we study this object for curves in C^3 in the viewpoint of Newton polygons.
Tin tức nổi bật
Hoạt động tuần
Hội thảo sắp diễn ra
Xuất bản mới
Vo Si Trong Long,
Nguyễn Mậu Nam,
Jacob Sharkansky,
Nguyễn Đông Yên,
Qualitative properties of k-center problems,
Journal of Optimization Theory and Applications Vol. 207 (2025), Paper 1, 23 pages
(SCI-E, Scopus)
.
Nguyễn Khoa Sơn,
Nguyễn Thị Hồng,
Lê Văn Ngọc,
Stability conditions for a class of nonlinear timevarying switched systems with delays and sectortype nonlinearities,
International Journal of Systems Science, Volume 57(2), (2025), 441-461
(SCI(-E); Scopus)
.
Trần Văn Thắng,
Lê Xuân Thanh,
Đỗ Thị Thùy,
A monotonic optimization approach to mixed variational inequality problems,
Optimization Letters, Volume 19, pages 1779–1800, (2025)
(SCI-E, Scopus)
.