Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
Preprint
Abstract
We propose a modified BFGS algorithm for multiobjective optimization problems with global convergence, even in the absence of convexity assumptions on the objective functions. Furthermore, we establish the superlinear convergence of the method under usual conditions. Our approach employs Wolfe step sizes and ensures that the Hessian approximations are updated and corrected at each iteration to address the lack of convexity assumption. Numerical results shows that the introduced modifications preserve the practical efficiency of the BFGS method.Keywords
All Related Versions
This publication has 41 references indexed in Scilit:
- Globally convergent Newton-type methods for multiobjective optimizationComputational Optimization and Applications, 2022
- Conditional gradient method for multiobjective optimizationComputational Optimization and Applications, 2021
- On the extension of the Hager–Zhang conjugate gradient method for vector optimizationComputational Optimization and Applications, 2019
- Quasi-Newton methods for multiobjective optimization problems4OR, 2017
- Inexact projected gradient method for vector optimizationComputational Optimization and Applications, 2012
- Newton-like methods for efficient solutions in vector optimizationComputational Optimization and Applications, 2012
- A perfect example for the BFGS methodMathematical Programming, 2012
- The BFGS method with exact line searches fails for non-convex objective functionsMathematical Programming, 2004
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- Steepest descent methods for multicriteria optimizationMathematical Methods of Operations Research, 2000