On the public citation graph
Optimization theory in linear spaces
0 signed · 27 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/0-387-22620-6_7openalex-snapshot
An Introduction to Functional Analysis
inferredcites →https://doi.org/10.1007/978-3-322-96210-2_2openalex-snapshot
Topological Vector Spaces
inferredcites →https://doi.org/10.1007/bf01350322openalex-snapshot
Optimization theory in linear spaces. I
inferredcites →https://doi.org/10.1016/b978-0-12-065201-3.50007-8openalex-snapshot
Introduction to Functional Analysis
inferredcites →https://doi.org/10.1515/crll.1902.124.1openalex-snapshot
Theorie der einfachen Ungleichungen.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-45486-8_12openalex-snapshot
On the Approximation of Solutions to Multiple Criteria Decision Making Problems
inferred← citeshttps://doi.org/10.1007/bf00934908openalex-snapshot
Duality for nonlinear multiple-criteria optimization problems
inferred← citeshttps://doi.org/10.1007/bf00939823openalex-snapshot
A survey of vector optimization in infinite-dimensional spaces, part 2
inferred← citeshttps://doi.org/10.1007/bf01098774openalex-snapshot
Analytical description of strong extremum in a convex set
inferred← citeshttps://doi.org/10.1007/bf01350314openalex-snapshot
Optimization theory in linear spaces
inferred← citeshttps://doi.org/10.1007/bf01350322openalex-snapshot
Optimization theory in linear spaces. I
inferred← citeshttps://doi.org/10.1007/bfb0120842openalex-snapshot
A multivalued approach to the Farkas lemma
inferred← citeshttps://doi.org/10.1016/0022-247x(75)90022-0openalex-snapshot
A duality theorem for a convex programming problem in order complete vector lattices
inferred← citeshttps://doi.org/10.1016/0022-247x(77)90283-9openalex-snapshot
The saddle point theorem of Kuhn and Tucker in ordered vector spaces
inferred← citeshttps://doi.org/10.1016/0022-247x(81)90093-7openalex-snapshot
Subdifferential calculus for convex operators
inferred← citeshttps://doi.org/10.1016/0022-247x(84)90027-1openalex-snapshot
Necessary conditions of nondominated solutions in multicriteria decision making
inferred← citeshttps://doi.org/10.1016/0022-247x(88)90035-2openalex-snapshot
Optimization in Banach spaces
inferred← citeshttps://doi.org/10.1016/b978-044450550-7/50003-xopenalex-snapshot
Smooth Optimization Problems. Saddle Point Conditions
inferred← citeshttps://doi.org/10.1080/09720510.2002.10701053openalex-snapshot
Farkas theorems for positively homogeneous quasiconvex functions
inferred← citeshttps://doi.org/10.1109/tac.1975.1101018openalex-snapshot
An algorithm for bicriteria optimization based on the sensitivity function
inferred← citeshttps://doi.org/10.1137/0315004openalex-snapshot
Proper Efficient Points for Maximizations with Respect to Cones
inferred← citeshttps://doi.org/10.1137/0316034openalex-snapshot
Weak Tangent Cones and Optimization in a Banach Space
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.