<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Azarbaijan Shahid Madani University</PublisherName>
				<JournalTitle>Communications in Combinatorics and Optimization</JournalTitle>
				<Issn>2538-2128</Issn>
				<Volume></Volume>
				<Issue>Articles in Press</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>06</Month>
					<Day>15</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A full-NT step interior-point method for weighted linear complementarity problem over symmetric cones</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">14973</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2025.29981.2251</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Behrouz</FirstName>
					<LastName>Kheirfam</LastName>
<Affiliation>Department of Mathematics, Azarbaijan Shahid Madani University, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Imelda S.</FirstName>
					<LastName>Aniversario</LastName>
<Affiliation>Center for Mathematical and Theoretical Physical Sciences PRISM,
MSU-Iligan Institute of Technology, Iligan City, Philippines</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>08</Month>
					<Day>28</Day>
				</PubDate>
			</History>
		<Abstract>A full Nesterov-Todd step interior point method is designed and analyzed in this paper to solve the weighted linear complementarity problem in Euclidean Jordan algebra. Under appropriate conditions, it is proven that the full Nesterov-Todd step is strictly feasible and the algorithm has a quadratic convergence rate to the target point on the central path in the framework of Euclidean Jordan algebras. The obtained iteration bound for the algorithm matches the best known current iteration bound for this problem. To the best of our knowledge, this is the first full-step interior point algorithm for the weighted complementarity problem in the space of Euclidean Jordan algebras.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Weighted linear complementarity problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Euclidean Jordan algebra</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Interior-point method</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Polynomial complexity</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_14973_827d19cd26c2c681903c9d056e5f4b1b.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
