DocumentCode
3492974
Title
Convergence of algorithms for solving the Nearest Point Problem in Reduced Convex Hulls
Author
López, Jorge ; Dorronsoro, José R.
Author_Institution
Dept. of Comput. Sci., Univ. Autonoma de Madrid, Madrid, Spain
fYear
2011
fDate
July 31 2011-Aug. 5 2011
Firstpage
413
Lastpage
420
Abstract
In this paper we establish a framework for the convergence of two algorithms for solving the Nearest Point Problem in Reduced Convex Hulls (RCH-NPP), namely the RCH-GSK method proposed in [1] and the RCH-MDM method suggested in [2]. This framework allows us to show the asymptotic convergence of both methods in a very simple way. Moreover, it allows to justify a shrinking strategy for RCH-MDM.
Keywords
convergence; convex programming; set theory; Gilbert-Schlesinger-Kozinec method; Mitchell-Dem´yanov-Malozemov method; RCH-GSK method; RCH-MDM method; RCH-NPP method; algorithm convergence; asymptotic convergence; nearest point problem; reduced convex hull; Buildings; Cognition; Convergence; Equations; Sorting; Support vector machines; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks (IJCNN), The 2011 International Joint Conference on
Conference_Location
San Jose, CA
ISSN
2161-4393
Print_ISBN
978-1-4244-9635-8
Type
conf
DOI
10.1109/IJCNN.2011.6033251
Filename
6033251
Link To Document