<?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>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>11</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2023</Year>
					<Month>03</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Applications of the proximal difference-of-convex algorithm with extrapolation in optimal correction</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>35</FirstPage>
			<LastPage>54</LastPage>
			<ELocationID EIdType="pii">5899</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2022.22498.1986</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Samira</FirstName>
					<LastName>Shahsavari</LastName>
<Affiliation>Department of Applied Mathematics,  Faculty of Mathematical Sciences University of Guilan, Rasht, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Saeed</FirstName>
					<LastName>Ketabchi</LastName>
<Affiliation>Department of Applied Mathematics,  Faculty of Mathematical Sciences University of Guilan, Rasht, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2022</Year>
					<Month>06</Month>
					<Day>15</Day>
				</PubDate>
			</History>
		<Abstract>This paper proposes a proximal difference-of-convex algorithm with extrapolation ($PDCA_e$)  based on Dinkelbach&#039;s approach for the optimal correction of  two types of piecewise linear systems, classical obstacle problems and equilibrium problems, and linear inequalities. Using  Dinkelbach&#039;s theorem  leads  to getting  the roots of two single-variable functions. Considering the non-convex and level-bounded properties of the obtained problems, we use a proximal difference-of-convex algorithm programming to solve them. The experimental results on several randomly generated test problems show that the $PDCA_e$-generalized Newton method  outperforms other methods for both feasible and infeasible cases.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Proximal difference-of-convex</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">extrapolation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">classical obstacle problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">equilibrium problems</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">linear inequalities</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">nonconvex</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">level-bounded</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_5899_66338635390d14bd52c966e73943f022.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
