<p>We propose a weighted HS (Hestenes-Stiefel)-FR (Fletcher-Reeves) hybrid conjugate gradient method for unconstrained multiobjective optimization problem, in which a new positive coefficient of the multiobjective steepest descent direction is adaptively updated to keep its positiveness. The method takes advantage of a weighted hybrid of our modified HS and FR parameters and under the Armijo-type backtracking line search, it has global convergence to a Pareto critical point (point satisfying the first-order necessary condition for Pareto optimality) without convexity assumption on the objectives. Numerical experiments show that the practical performance of the method is competitive with the existing methods such as conjugate gradient method, steepest descent method, Newton method, and quasi-Newton method for unconstrained multiobjective optimization.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A weighted hybrid conjugate gradient method for unconstrained multiobjective optimization problems

  • Yunchol Jong,
  • Wonchol Hwang,
  • Yungwang Rim

摘要

We propose a weighted HS (Hestenes-Stiefel)-FR (Fletcher-Reeves) hybrid conjugate gradient method for unconstrained multiobjective optimization problem, in which a new positive coefficient of the multiobjective steepest descent direction is adaptively updated to keep its positiveness. The method takes advantage of a weighted hybrid of our modified HS and FR parameters and under the Armijo-type backtracking line search, it has global convergence to a Pareto critical point (point satisfying the first-order necessary condition for Pareto optimality) without convexity assumption on the objectives. Numerical experiments show that the practical performance of the method is competitive with the existing methods such as conjugate gradient method, steepest descent method, Newton method, and quasi-Newton method for unconstrained multiobjective optimization.