Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
- 442 Downloads
A trust-region-based algorithm for the nonconvex unconstrained multiobjective optimization problem is considered. It is a generalization of the algorithm proposed by Fliege et al. (SIAM J Optim 20:602–626, 2009), for the convex problem. Similarly to the scalar case, at each iteration a subproblem is solved and the step needs to be evaluated. Therefore, the notions of decrease condition and of predicted reduction are adapted to the vectorial case. A rule to update the trust region radius is introduced. Under differentiability assumptions, the algorithm converges to points satisfying a necessary condition for Pareto points and, in the convex case, to a Pareto points satisfying necessary and sufficient conditions. Furthermore, it is proved that the algorithm displays a q-quadratic rate of convergence. The global behavior of the algorithm is shown in the numerical experience reported.
KeywordsMultiobjective optimization Trust region Newton method Convergence
Mathematics Subject Classification90C29 65K05 49M37
The authors are grateful to the anonymous reviewers, whose comments improved this work.
- 5.Carrizo, G.A.: Estrategia de región de confianza para problemas multiobjetivo no convexos. Universidad Nacional del Sur, Argentina (2013)Google Scholar
- 11.Fischer, A., Shukia, P.K.: A Levenberg–Marquardt aglorithm for uncostrained multicriteria optimization. Oper. Res. Lett. 175, 395–414 (2005)Google Scholar