解决向量优化问题的一种非单调投影梯度算法
A Nonmonotone Projected Gradient Algorithm for Solving Vector Optimization Problems
摘要: 本文引入一种新的算法:极大型投影梯度算法,它是将解决带约束向量优化问题的投影梯度算法和极大型非单调线搜索技术相结合的一种算法。下降方向通过由解决单目标规划的投影梯度算法推广到向量优化的投影梯度算法来得到,而在步长选择上采用经典的单调线搜索技术容易陷入局部收敛的困境,与非单调技术结合以后,可以摆脱这一困境。在合适的条件下,证明了算法的全局收敛和线性收敛性。
Abstract: This paper introduces a new algorithm: the max-type projected gradient algorithm, which combines the projected gradient algorithm for solving constrained vector optimization problems with the max-type nonmonotone line search technology. The Descent direction is obtained by extending the projection gradient algorithm for solving single objective programming to the projection gradient algorithm for vector optimization, while the classical monotone line search technology in step size selection is easy to fall into the dilemma of local convergence, which can be overcome by combining with nonmonotone technology. Under milder conditions, the global and linear convergences of the algorithm were demonstrated, and numerical experiments were conducted to verify its effective-ness.
文章引用:刘雪, 周犁文. 解决向量优化问题的一种非单调投影梯度算法[J]. 应用数学进展, 2023, 12(5): 2327-2339. https://doi.org/10.12677/AAM.2023.125237

参考文献

[1] Wiecek, M.M. (2007) Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria. Deci-sion Making in Manufacturing and Services, 1, 153-173. [Google Scholar] [CrossRef
[2] De, P. and Wells, G.C.E. (1992) On the Minimization of Completion Time Variance with a Bicriteria Extension. Operations Research, 40, 1148-1155. [Google Scholar] [CrossRef
[3] White, D.J. (1998) Epsilon-Dominating So-lutions in Mean-Variance Portfolio Analysis. European Journal of Operational Research, 105, 457-466. [Google Scholar] [CrossRef
[4] Quiroz, E.A.P., Apolinario, H.C.F., Villacorta, K.D. and Oliveira, P.R. (2019) A Linear Scalarization Proximal Point Method for Quasiconvex Multiobjective Minimization. Journal of Optimization Theory and Applications, 183, 1028- 1052. [Google Scholar] [CrossRef
[5] Fliege, J. and Svaiter, B.F. (2000) Steepest Descent Methods for Multicriteria Optimization. Mathematical Methods of Operations Research, 51, 479-494. [Google Scholar] [CrossRef
[6] Fuege, J., Grana Drummond, L.M. and Svaiter, B.F. (2010) New-ton’s Method for Multiobjective Optimization. SIAM Journal on Optimization: A Publication of the Society for Industrial and Applied Mathematics, 20, 602-626. [Google Scholar] [CrossRef
[7] Drummond, L. and Iusem, A.N. (2004) A Projected Gradient Method for Vector Optimization Problems. Computational Optimization & Applications, 28, 5-29. [Google Scholar] [CrossRef
[8] Yunier, J. and Cruz, B. (2013) A Subgradient Meth-od for Vector Optimization Problems. SIAM Journal on Optimization, 23, 2169-2182. [Google Scholar] [CrossRef
[9] Brito, A.S., Neto, J., Santos, P., et al. (2017) A Relaxed Projection Meth-od for Solving Multiobjective Optimization Problems. European Journal of Operational Research, 256, 17-23. [Google Scholar] [CrossRef
[10] Bento, G.C., Cruz Neto, J.X., Santos, P.S.M. and Souza, S.S. (2018) A Weighting Subgradient Algorithm for Multiobjective Optimization. Optimization Letters, 12, 399-410. [Google Scholar] [CrossRef
[11] Boyd, S. and Vandenberghe, L. (2004) Convex Optimization. Cambridge University Press, 727. [Google Scholar] [CrossRef
[12] Mahdavi-Amiri, N. and Salehi Sadaghiani, F. (2020) A Super-linearly Convergent Nonmonotone Quasi-Newton Method for Unconstrained Multiobjective Optimization. Optimization Methods and Software, 35, 1223-1247. [Google Scholar] [CrossRef
[13] Dai, Y.H. (2002) On the Nonmonotone Line Search. Journal of Optimization Theory and Applications, 112, 315-330. [Google Scholar] [CrossRef