Pith. sign in

REVIEW 1 cited by

Some optimality conditions of set-valued optimization problems in locally convex topological vector spaces

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 2403.02101 v1 pith:TPSFOOLP submitted 2024-03-04 math.OC

Some optimality conditions of set-valued optimization problems in locally convex topological vector spaces

classification math.OC
keywords convexoptimizationproblemsset-valuedsolutionsyangconditionsefficient
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this article, we work with set-valued optimization problems in locally convex topological vector spaces. We prove the equivalencies of some definitions of generalized convex maps introduced by Jeyakumar, Yang, Yang & Yang & Chen, as well as Zeng. And then, we discuss the conditions of weakly efficient solutions, proper efficient solutions, and optimal solutions of set-valued optimization problems.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Position: Safety and Fairness in Agentic AI Depend on Interaction Topology, Not on Model Scale or Alignment

    cs.AI 2026-05 unverdicted novelty 5.0

    In agentic AI, safety and fairness are governed by interaction topology rather than model scale or alignment.