<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.6//EN" "http://www.ncbi.nlm.nih.gov/corehtml/query/static/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Iranian Mathematical Society (IMS)</PublisherName>
				<JournalTitle>Bulletin of the Iranian Mathematical Society</JournalTitle>
				<Issn>1017-060X</Issn>
				<Volume>37</Volume>
				<Issue>No. 4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2011</Year>
					<Month>12</Month>
					<Day>15</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Best proximity pair and coincidence point theorems for nonexpansive set-valued maps in Hilbert spaces</ArticleTitle><FirstPage>229</FirstPage>
			<LastPage>234</LastPage>
			<Language>en</Language>
<AuthorList>
<Author>
					<FirstName>A. </FirstName>
					<LastName>Amini-Harandi</LastName>
					<Affiliation></Affiliation>
				</Author>
</AuthorList>
			<History>
				<PubDate PubStatus="received">
					<Year>2010</Year>
					<Month>02</Month>
					<Day>10</Day>
				</PubDate>
			</History>
		<Abstract><![CDATA[This paper is concerned with the best proximity pair problem in Hilbert spaces. Given two subsets $A$ and $B$ of a Hilbert space $H$ and the set-valued maps $F:A	o 2^ B$ and $G:A_0	o 2^{A_0}$, where $A_0={xin A: |x-y|=d(A,B)~~~mbox{for some}~~~ yin B}$, best proximity pair theorems provide sufficient conditions that ensure the existence of an $x_0in A$ such that $$d(G(x_0),F(x_0))=d(A,B).$$]]></Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Best proximity pair</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">coincidence point</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">nonexpansive map</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Hilbert space</Param>
			</Object>
		</ObjectList>
</Article>
</ArticleSet>