On the public citation graph

Maximal points with respect to cone dominance in Banach spaces and their existence

https://doi.org/10.1007/bf00934893
0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/zamm.19790591225openalex-snapshot
Barbu, V./Precupanu, Th., Convexity and Optimization in Banach Spaces. Bucuresti. Editura Academiei. Alphen an de Rijn. Sijthoff & Noordhoff Intern. Publ. 1978. XI, 316 S., Dfl. 60.00. $ 28.00
inferredcites →https://doi.org/10.1007/978-94-010-2918-6openalex-snapshot
Convexity and optimization in Banach spaces
inferredcites →https://doi.org/10.1007/bf00932614openalex-snapshot
Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
inferredcites →https://doi.org/10.1007/bf00932907openalex-snapshot
Connectedness of the set of nondominated outcomes in multicriteria optimization
inferredcites →https://doi.org/10.1007/bf00933437openalex-snapshot
Duality theory in multiobjective programming
inferredcites →https://doi.org/10.1007/bf00934115openalex-snapshot
An existence result for maximizations with respect to cones
inferredcites →https://doi.org/10.1007/bf00934453openalex-snapshot
The structure of admissible points with respect to cone dominance
inferredcites →https://doi.org/10.1016/0022-247x(68)90201-1openalex-snapshot
Proper efficiency and the theory of vector maximization
inferredcites →https://doi.org/10.1090/s0002-9947-1978-0506609-1openalex-snapshot
Existence Theorems for Pareto Optimization; Multivalued and Banach Space Valued Functionals
inferredcites →https://doi.org/10.1137/0134018openalex-snapshot
On Cone-Efficiency, Cone-Convexity and Cone-Compactness
inferredcites →https://doi.org/10.1515/9781400881970-006openalex-snapshot
5. Admissible Points of Convex Sets
inferredcites →https://doi.org/10.4153/cjm-1977-002-0openalex-snapshot
Semi-Compactness with Respect to a Euclidean Cone

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jmaa.1997.5550openalex-snapshot
The Domination Property for Efficiency in Locally Convex Spaces
inferred← citeshttps://doi.org/10.1007/0-306-48107-3_1openalex-snapshot
Theory of Vector Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-3623-6_12openalex-snapshot
Efficiency
inferred← citeshttps://doi.org/10.1007/978-3-642-54265-7_9openalex-snapshot
Existence Results for Minimal Points
inferred← citeshttps://doi.org/10.1007/bf00938317openalex-snapshot
Remarks on convex cones
inferred← citeshttps://doi.org/10.1007/bf00938796openalex-snapshot
A minimax theorem for vector-valued functions
inferred← citeshttps://doi.org/10.1007/bf00939934openalex-snapshot
A minimax theorem for vector-valued functions, part 2
inferred← citeshttps://doi.org/10.1007/bf00940631openalex-snapshot
Existence of maximal points with respect to ordered bipreference relations
inferred← citeshttps://doi.org/10.1007/bf01581236openalex-snapshot
On the convergence of iterative methods for symmetric linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf02192161openalex-snapshot
Density of the set of positive proper minimal points in the set of minimal points
inferred← citeshttps://doi.org/10.1007/bfb0076704openalex-snapshot
On pareto's problems
inferred← citeshttps://doi.org/10.1016/0022-247x(90)90001-vopenalex-snapshot
Inclusion theorems for non-explosive and strongly exposed cones in normed spaces
inferred← citeshttps://doi.org/10.1016/j.jmaa.2004.07.003openalex-snapshot
Pareto optimization in topological vector spaces
inferred← citeshttps://doi.org/10.1016/j.jmaa.2012.12.072openalex-snapshot
The domination property for efficiency and Bishop–Phelps theorem in locally convex spaces
inferred← citeshttps://doi.org/10.1016/s0022-247x(03)00013-1openalex-snapshot
Characterizations of some remarkable classes of cones
inferred← citeshttps://doi.org/10.1023/a:1004670229860openalex-snapshot
Comparison of Existence Results for Efficient Points
inferred← citeshttps://doi.org/10.1080/02331939208843858openalex-snapshot
Countably orderable sets and their applications in optimization
inferred← citeshttps://doi.org/10.1142/9789812778215_0010openalex-snapshot
On Pareto Efficiency: A General Constructive Existence Principle
inferred← citeshttps://doi.org/10.1155/2013/704251openalex-snapshot
A Minimax Theorem for L-0 -Valued Functions on Random Normed Modules
inferred← citeshttps://doi.org/10.11650/twjm/1500406594openalex-snapshot
EXISTENCE RESULTS FOR VECTOR SADDLE POINTS PROBLEMS
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.