On the public citation graph

Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. I: Hyperplane theorems

https://doi.org/10.1007/bf01442563
0 signed · 24 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.19630430313openalex-snapshot
M. Day, Normed Linear Spaces. Second printing corrected. VIII + 139 S. Berlin/Göttingen/Heidelberg 1962. Springer‐Verlag. Preis brosch. DM 17,80
inferredcites →https://doi.org/10.1007/978-3-662-09000-8openalex-snapshot
Normed Linear Spaces
inferredcites →https://doi.org/10.1007/978-3-662-41637-2_2openalex-snapshot
Normed Linear Spaces
inferredcites →https://doi.org/10.1016/0022-247x(79)90168-9openalex-snapshot
Generalizations of methods of best approximation to convex optimization in locally convex spaces. II: Hyperplane theorems
inferredcites →https://doi.org/10.1016/0022-247x(80)90037-2openalex-snapshot
Duality theorems for linear systems and convex systems
inferredcites →https://doi.org/10.1016/0362-546x(79)90079-8openalex-snapshot
Some new applications of the Fenchel-Rockafellar duality theorem: Lagrange multiplier theorems and hyperplane theorems for convex optimization and best approximation
inferredcites →https://doi.org/10.1080/02331938008842649openalex-snapshot
Minimization of continuous convex functional on complements of convex subsets of locally convex spaces 1

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.5745openalex-snapshot
Necessary and Sufficient Global Optimality Conditions for Convex Maximization Revisited
inferred← citeshttps://doi.org/10.1007/978-1-4613-0295-7_16openalex-snapshot
On Duality for Quasi-convex Supremization and Reverse Convex Infimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-6019-4_13openalex-snapshot
From Convex Optimization to Nonconvex Optimization. Necessary and Sufficient Conditions for Global Optimality
inferred← citeshttps://doi.org/10.1007/bf02614516openalex-snapshot
On the degree and separability of nonconvexity and applications to optimization problems
inferred← citeshttps://doi.org/10.1007/bf03323359openalex-snapshot
Maximization of lower semi-continuous convex functional on bounded subsets of locally convex spaces. II: Quasi-Lagrangian duality theorems
inferred← citeshttps://doi.org/10.1016/0022-247x(80)90037-2openalex-snapshot
Duality theorems for linear systems and convex systems
inferred← citeshttps://doi.org/10.1016/0022-247x(81)90075-5openalex-snapshot
Duality theorems for perturbed convex optimization
inferred← citeshttps://doi.org/10.1016/j.laa.2019.09.002openalex-snapshot
On farthest Voronoi cells
inferred← citeshttps://doi.org/10.1023/a:1008327614099openalex-snapshot
Duality for Anticonvex Programs
inferred← citeshttps://doi.org/10.1080/01630560008816995openalex-snapshot
Lagrangian duality theorems for reverse convex infimization
inferred← citeshttps://doi.org/10.1080/01630568208816112openalex-snapshot
Zur existenz von lösungen konvexer optimierungsaufgaben in lokalkonvexen räumen
inferred← citeshttps://doi.org/10.1080/01630568508816180openalex-snapshot
Extensions of functions of 0-1 variables and applications to combinatorial optimization
inferred← citeshttps://doi.org/10.1080/02331938008842649openalex-snapshot
Minimization of continuous convex functional on complements of convex subsets of locally convex spaces 1
inferred← citeshttps://doi.org/10.1080/02331938408842904openalex-snapshot
Optimization by level set methods v:duality theorems for perturbed optimization problems2
inferred← citeshttps://doi.org/10.1080/02331938708843264openalex-snapshot
Optimization by level set methods vi:generalizations of surrogate type reverse convex duality
inferred← citeshttps://doi.org/10.1080/02331939908844436openalex-snapshot
Duality in quasi-convex supremization and reverse convex infimization via abstract convex analysis,and applications to approximation **
inferred← citeshttps://doi.org/10.1137/140968409openalex-snapshot
Optimality Conditions for the Minimization of Quadratic 0-1 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.