Mau Nam Nguyen
Date of Award
Bachelor of Arts (B.A.) in Mathematics and University Honors
Convex geometry, Mathematical optimization
The Fermat-Torricelli problem asks for a point that minimizes the sum of the distances to three given points in the plane. This problem was introduced by the French mathematician Fermat in the 17th century and was solved by the Italian mathematician and physicist Torricelli. In this thesis we introduce a constrained version of the Fermat-Torricelli problem in high dimensions that involves distances to a finite number of points with both positive and negative weights. Based on the distance penalty method, Nesterov’s smoothing technique, and optimization techniques for minimizing differences of convex functions, we provide effective algorithms to solve the problem. Attaining numerical results is a work in progress.
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
Lawrence, Nathan, "Convex and Nonconvex Optimization Techniques for the Constrained Fermat-Torricelli Problem" (2016). University Honors Theses. Paper 317.