arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.02461math.OC
收藏

多目标优化的无需线搜索共轭梯度法

Conjugate gradient methods without line search for multiobjective optimization

Wang Chen, Yong Zhao, Liping Tang, Xinmin Yang

AI总结:

针对无约束多目标优化问题,本文采用固定步长公式替代Wolfe型线搜索,推导了Zoutendijk型条件,证明了多种共轭梯度参数向量扩展的全局收敛性,并通过实验验证了其优于传统线搜索方法的性能。

摘要:

本文研究无约束多目标优化问题,即需最小化两个或多个连续可微函数。我们深入探讨了Lucambio Pérez和Prudente(SIAM J Optim, 28(3): 2690--2720, 2018)针对此类问题提出的共轭梯度法。我们采用固定步长公式(或无线搜索方案)代替其工作中使用的Wolfe型线搜索过程,这能减轻由多个不等式引起的步长选择压力,并避免特定应用中函数评估带来的计算成本。该无线搜索方案被用于推导Zoutendijk型条件。在温和假设下,全局收敛性涵盖了Fletcher--Reeves、共轭下降、Dai--Yuan、Polak--Ribière--Polyak和Hestenes--Stiefel参数的向量扩展。此外,进行了数值实验以展示所提步长规则的实际性能,并与使用Armijo线搜索的多目标最速下降法及使用Wolfe型线搜索的多目标共轭梯度法进行了比较分析。

英文摘要:

This paper addresses unconstrained multiobjective optimization problems where two or more continuously differentiable functions have to be minimized. We delve into the conjugate gradient methods proposed by Lucambio Pérez and Prudente (SIAM J Optim, 28(3): 2690--2720, 2018) for such problems. Instead of the Wolfe-type line search procedure used in their work, we employ a fixed stepsize formula (or no-line-search scheme), which can mitigate the pressure of choosing stepsize caused by multiple inequalities and avoid the computational cost associated with function evaluations in specific applications. The no-line-search scheme is utilized to derive the condition of Zoutendijk's type. Global convergence encompasses the vector extensions of Fletcher--Reeves, conjugate descent, Dai--Yuan, Polak--Ribière--Polyak and Hestenes--Stiefel parameters, subject to certain mild assumptions. Additionally, numerical experiments are conducted to demonstrate the practical performance of the proposed stepsize rule, and comparative analyses are made with the multiobjective steepest descent methods using the Armijo line search and the multiobjective conjugate gradient methods using the Wolfe-type line search.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑