Pith. sign in

REVIEW

Two nonmonotone multiobjective memory gradient algorithms

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

arxiv 2311.17702 v1 pith:3BGJ4LLT submitted 2023-11-29 math.OC

Two nonmonotone multiobjective memory gradient algorithms

classification math.OC
keywords algorithmsgradientmemorymultiobjectivenonmonotonealgorithmconditionsconvergence
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

In this paper, two types of nonmonotone memory gradient algorithm for solving unconstrained multiobjective optimization problems are introduced. Under some suitable conditions, we show the convergence of the full sequence generated by the proposed algorithms to a weak Pareto optimal point

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.