REVIEW
On the convergence of conditional gradient method for unbounded multiobjective optimization problems
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
On the convergence of conditional gradient method for unbounded multiobjective optimization problems
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.