<?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>09</Month>
					<Day>10</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A new quasi-Newton algorithm for constructing the Pareto front of multiobjective optimization problems by implementing warm-start strategies</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">15014</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2025.30421.2459</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Fereshteh</FirstName>
					<LastName>Akbari</LastName>
<Affiliation>Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Esmaile</FirstName>
					<LastName>Khorram</LastName>
<Affiliation>Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Mehrdad</FirstName>
					<LastName>Ghaznavi</LastName>
<Affiliation>Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>03</Month>
					<Day>14</Day>
				</PubDate>
			</History>
		<Abstract>Many numerical procedures for finding efficient solutions of multiobjective optimization problems are variants of Newton method, that utilize the Hessian matrix of second derivatives. Quasi-Newton methods are used for situations in which the calculation of the Hessian matrix or its inverse is difficult or expensive. In the quasi-Newton methods, only first derivatives are utilized to build an approximation of the actual Hessian matrix over a number of iterations. One of the weaknesses of Newton and quasi-Newton methods is choosing the proper starting points. In fact, the starting points should be close enough to the nondominated solution to have at least quadratic convergence. Therefore, in this study, by applying the convex hull of the individual minimums (CHIMs), we present a procedure for selecting an appropriate starting point for the quasi-Newton method with the BFGS (Broyden, Fletcher, Goldfarb and Shanno) approximation. Moreover, a new algorithm for constructing a uniform approximation of the Pareto front is presented, which can produce more than one efficient point located on the Pareto front in each iteration. To comprehensively compare the proposed algorithm with existing algorithms, three indices are considered: purity metric, measures of coverage, and spacing metric. Extensive numerical experiments show the significant advantage of the proposed algorithm. Moreover, the obtained boundary approximation follows an almost uniform distribution.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Multiobjective optimization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Quasi-Newton method</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Stationary point</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Convergence</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_15014_4fa75dc06754787f27af2c7a4507c6e6.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
