On the convergence of conditional gradient method for unbounded multiobjective optimization problems
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:5Z3HWK3Yrecord.jsonopen to challenge →
classification
math.OC
keywords
algorithmconditionalconvergencegradientmultiobjectiveoptimizationproblemsunbounded
read the original abstract
This paper focuses on developing a conditional gradient algorithm for multiobjective optimization problems with an unbounded feasible region. We employ the concept of recession cone to establish the well-defined nature of the algorithm. The asymptotic convergence property and the iteration-complexity bound are established under mild assumptions. Numerical examples are provided to verify the algorithmic performance.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.