多目标优化非单调线性加权牛顿算法
Nonmonotone Linear Weighted Newton Algorithm for Multi-Objective Optimization
摘要: 本文提出了一种求解多目标优化问题的非单调线性加权牛顿算法。在目标函数有下界且梯度Lipschitz连续的条件下证明了算法的全局收敛性。在目标函数满足二次连续可微且局部强凸的条件下,证明了该算法具有局部超线性收敛速度。数值实验结果表明,相比于单调线性加权牛顿算法,该算法能够更加高效地求解多目标优化问题。
Abstract: This paper introduces a nonmonotone linear weighted Newton algorithm for solving multi-objective optimization problems. It is shown that the algorithm achieves global convergence under the assumption of a lower bound on the objective function and a Lipschitz continuous gradient. Furthermore, under the conditions of quadratic continuous differentiability and local strong convexity, the algorithm demonstrates local superlinear convergence. Numerical experiments demonstrate that this algorithm outperforms the monotone linear weighted Newton algorithm in efficiently solving multi-objective optimization problems.
文章引用:欧杨. 多目标优化非单调线性加权牛顿算法[J]. 应用数学进展, 2024, 13(6): 2930-2942. https://doi.org/10.12677/aam.2024.136280

参考文献

[1] 林锉云, 董加礼. 多目标优化的方法与理论[M]. 长春: 吉林教育出版社, 1992.
[2] Fliege, J., Drummond, L.M.G. and Svaiter, B.F. (2009) Newton’s Method for Multiobjective Optimization. SIAM Journal on Optimization, 20, 602-626. [Google Scholar] [CrossRef
[3] 江术兰. 多目标优化问题的标量化方法及牛顿算法[D]: [硕士学位论文]. 重庆: 重庆师范大学, 2022.
[4] Fliege, J. and Svaiter, B.F. (2000) Steepest Descent Methods for Multicriteria Optimization. Mathematical Methods of Operations Research (ZOR), 51, 479-494. [Google Scholar] [CrossRef
[5] Drummond, L.M.G. and Iusem, A.N. (2004) A Projected Gradient Method for Vector Optimization Problems. Computational Optimization and Applications, 28, 5-29. [Google Scholar] [CrossRef
[6] Lucambio Pérez, L.R. and Prudente, L.F. (2018) Nonlinear Conjugate Gradient Methods for Vector Optimization. SIAM Journal on Optimization, 28, 2690-2720. [Google Scholar] [CrossRef
[7] Povalej, Ž. (2014) Quasi-Newton’s Method for Multiobjective Optimization. Journal of Computational and Applied Mathematics, 255, 765-777. [Google Scholar] [CrossRef
[8] Zhang, H. and Hager, W.W. (2004) A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization. SIAM Journal on Optimization, 14, 1043-1056. [Google Scholar] [CrossRef
[9] Grippo, L., Lampariello, F. and Lucidi, S. (1986) A Nonmonotone Line Search Technique for Newton’s Method. SIAM Journal on Numerical Analysis, 23, 707-716. [Google Scholar] [CrossRef
[10] Mita, K., Fukuda, E.H. and Yamashita, N. (2019) Nonmonotone Line Searches for Unconstrained Multiobjective Optimization Problems. Journal of Global Optimization, 75, 63-90. [Google Scholar] [CrossRef
[11] Dumitrescu, D., Grosan, C. and Oltean, M. (2000) A New Evolutionary Approach for Multiobjective Optimization. Studia Universitatis Babes-Bolyai Informatica, 45, 51-68.
[12] Mao, J., Hirasawa, K., Hu, J. and Murata, J. (2001) Genetic Symbiosis Algorithm for Multiobjective Optimization Problems. Transactions of the Society of Instrument and Control Engineers, 37, 893-901. [Google Scholar] [CrossRef
[13] Shim, M., Suh, M., Furukawa, T., Yagawa, G. and Yoshimura, S. (2002) Pareto-Based Continuous Evolutionary Algorithms for Multiobjective Optimization. Engineering Computations, 19, 22-48. [Google Scholar] [CrossRef
[14] Custódio, A.L., Madeira, J.F.A., Vaz, A.I.F. and Vicente, L.N. (2011) Direct Multisearch for Multiobjective Optimization. SIAM Journal on Optimization, 21, 1109-1140. [Google Scholar] [CrossRef
[15] Laumanns, M., Rudolph, G. and Schwefel, H.P. (1998) A Spatial Predator-Prey Approach to Multi-Objective Optimization: A Preliminary Study. Lecture Notes in Computer Science, 5, 241-249.
[16] Huband, S., Hingston, P., Barone, L. and While, L. (2006) A Review of Multiobjective Test Problems and a Scalable Test Problem Toolkit. IEEE Transactions on Evolutionary Computation, 10, 477-506. [Google Scholar] [CrossRef
[17] Preuss, M., Naujoks, B. and Rudolph, G. (2006) Pareto Set and EMOA Behavior for Simple Multimodal Multiobjective Functions. International Conference on Parallel Problem Solving from Nature, Reykjavik, 9-13 September 2006, 513-522.
[18] Sefrioui, M. and Perlaux, J. (2000) Nash Genetic Algorithms: Examples and Applications. Proceedings of the 2000 Congress on Evolutionary Computation, La Jolla, 16-19 July 2000, 509-516.
[19] Thomann, J. and Eichfelder, G. (2019) Numerical Results for the Multiobjective Trust Region Algorithm MHT. Data in Brief, 25, Article ID: 104103. [Google Scholar] [CrossRef] [PubMed]
[20] Vlennet, R., Fonteix, C. and Marc, I. (1996) Multicriteria Optimization Using a Genetic Algorithm for Determining a Pareto Set. International Journal of Systems Science, 27, 255-260. [Google Scholar] [CrossRef
[21] Ansary, M.A.T. and Panda, G. (2014) A Modified Quasi-Newton Method for Vector Optimization Problem. Optimization, 64, 2289-2306. [Google Scholar] [CrossRef
[22] Stadler, W. and Dauer, J. (1993) Multicriteria Optimization in Engineering: A Tutorial and Survey. Progress in Astronautics and Aeronautics, 150, 209-249.
[23] Das, I. and Dennis, J.E. (1998) Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems. SIAM Journal on Optimization, 8, 631-657. [Google Scholar] [CrossRef
[24] Jin, Y., Olhofer, M. and Sendho, B. (2001) Dynamic Weighted Aggregation for Evolutionary Multi-Objective Optimization: Why Does It Work and How. Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation, San Francisco, 7-11 July 2001, 1042-1049.