The Generalized Fermat–Torricelli Problem in Hilbert Spaces
Simeon Reich () and
Truong Minh Tuyen ()
Additional contact information
Simeon Reich: The Technion – Israel Institute of Technology
Truong Minh Tuyen: Thai Nguyen University of Sciences
Journal of Optimization Theory and Applications, 2023, vol. 196, issue 1, No 4, 78-97
Abstract:
Abstract We study the generalized Fermat–Torricelli problem and the split feasibility problem with multiple output sets in Hilbert spaces. We first introduce the generalized Fermat–Torricelli problem, and propose and analyze a subgradient algorithm for solving this model problem. Then we study the convergence of variants of our proposed algorithm for solving the split feasibility problem with multiple output sets. Our algorithms for solving this problem are completely different from previous ones because we do not use the least squares sum method.
Keywords: Hilbert space; Fermat–Torricelli problem; Metric projection; 47H05; 47H09; 49J53; 90C25 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10957-022-02113-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:196:y:2023:i:1:d:10.1007_s10957-022-02113-z
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1007/s10957-022-02113-z
Access Statistics for this article
Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull
More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().