On the public citation graph
Duale Optimierungsaufgaben und Sattelpunktsätze
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.
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/bf00536646openalex-snapshot
Optimierungsaufgaben in topologischen Vektorr�umen I: Dualit�tstheorie
inferredcites →https://doi.org/10.1007/bf01385903openalex-snapshot
Duality in nonlinear programming and the minimax theorem
inferredcites →https://doi.org/10.1007/bf01386054openalex-snapshot
�ber einen Dualit�tssatz der nichtlinearen programmierung
inferredcites →https://doi.org/10.1007/bf01919477openalex-snapshot
Dualität bei konvexen Optimierungs-(Programmierungs-)Aufgaben
inferredcites →https://doi.org/10.1016/0022-247x(65)90101-0openalex-snapshot
Minmax and duality in nonlinear programming
inferredcites →https://doi.org/10.1016/0022-247x(67)90011-xopenalex-snapshot
Convex programming and systems of elementary monotonic relations
inferredcites →https://doi.org/10.1016/0022-247x(67)90095-9openalex-snapshot
Strictly quasi-convex (concave) functions and duality in mathematical programming
inferredcites →https://doi.org/10.2140/pjm.1967.21.167openalex-snapshot
Duality and stability in extremum problems involving convex functions
inferredcites →https://doi.org/10.2140/pjm.1968.25.597openalex-snapshot
A general correspondence between dual minimax problems and convex programs
inferredcites →https://doi.org/10.2307/1907579openalex-snapshot
Studies in Linear and Non-Linear Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-07623-9_299openalex-snapshot
Some remarks on generalized lagrangians
inferred← citeshttps://doi.org/10.1007/978-3-031-30324-1_8openalex-snapshot
Convex Optimization: Saddle Points Characterization and Introduction to Duality
inferred← citeshttps://doi.org/10.1007/978-3-642-80630-8_4openalex-snapshot
Entwicklungstendenzen in der mathematischen Optimierung, aufgezeigt an Beispielen der neueren Literatur
inferred← citeshttps://doi.org/10.1080/02331887408801144openalex-snapshot
Zur theorie der polarfunktionale
inferred← citeshttps://doi.org/10.1080/02331937708842404openalex-snapshot
Verallgemeinerte konvexe funktionen
inferred← citeshttps://doi.org/10.1080/02331938208842761openalex-snapshot
Relations between Generalized Concepts of Convexity and Conjugacy
inferred← citeshttps://doi.org/10.1080/02331938808843352openalex-snapshot
Zur c-konvexität und c-subdifferenzierbarkeit von funktionalen
inferred← citeshttps://doi.org/10.1137/0316018openalex-snapshot
On $\Phi $-Convexity in Extremal Problems
inferred← citeshttps://doi.org/10.33993/jnaat11-1openalex-snapshot
Dualität bei Optimierungsaufgaben in halbgeordneten topologischen Vektorräumen (I)
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.