On the public citation graph

A duality approach to minimax results for quasi-saddle functions in finite dimensions

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.
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.1007/978-3-642-45567-4_5openalex-snapshot
Generalized Convexity, Functional Hulls and Applications to Conjugate Duality in Optimization
inferredcites →https://doi.org/10.1007/bf01448847openalex-snapshot
Zur Theorie der Gesellschaftsspiele
inferredcites →https://doi.org/10.1007/bf01582050openalex-snapshot
A convex-like duality scheme for quasi-convex programs
inferredcites →https://doi.org/10.1007/bf01582120openalex-snapshot
Duality theorems for certain programs involving minimum or maximum operations
inferredcites →https://doi.org/10.1007/bf01589356openalex-snapshot
Global saddle-point duality for quasi-concave programs
inferredcites →https://doi.org/10.1007/bf01766858openalex-snapshot
Conjugaison par tranches
inferredcites →https://doi.org/10.1007/bf01916921openalex-snapshot
Exact quasiconvex conjugation
inferredcites →https://doi.org/10.1007/bf02591881openalex-snapshot
Conjugacy in quasi-convex programming
inferredcites →https://doi.org/10.1080/01630568208816118openalex-snapshot
Optimization by level set methods. IV: Generalizations and complements
inferredcites →https://doi.org/10.1137/0116088openalex-snapshot
Quasi-Convex Programming
inferredcites →https://doi.org/10.1137/0316018openalex-snapshot
On $\Phi $-Convexity in Extremal Problems
inferredcites →https://doi.org/10.1287/moor.9.4.576openalex-snapshot
A Minimax Theorem
inferredcites →https://doi.org/10.1287/opre.18.5.924openalex-snapshot
Surrogate Mathematical Programming
inferredcites →https://doi.org/10.1287/opre.21.1.162openalex-snapshot
The Generalized Penalty-Function/Surrogate Model
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2140/pjm.1954.4.65openalex-snapshot
On von Neumann’s minimax theorem
inferredcites →https://doi.org/10.2140/pjm.1958.8.171openalex-snapshot
On general minimax theorems

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-0-387-77247-9openalex-snapshot
Pareto Optimality, Game Theory And Equilibria
inferred← citeshttps://doi.org/10.1007/978-0-387-77247-9_1openalex-snapshot
Minimax: Existence and Stability
inferred← citeshttps://doi.org/10.1007/978-3-642-46802-5_14openalex-snapshot
Duality theory for convex/quasiconvex functions and its application to optimization
inferred← citeshttps://doi.org/10.1007/s11784-015-0225-4openalex-snapshot
Some of Sion’s heirs and relatives
inferred← citeshttps://doi.org/10.1016/j.jmaa.2021.125862openalex-snapshot
Ky-Fan inequality, Nash equilibria in some idempotent and harmonic convex structure
inferred← citeshttps://doi.org/10.1023/a:1015308820980openalex-snapshot
A Topological Minimax Theorem
inferred← citeshttps://doi.org/10.1080/02331930008844473openalex-snapshot
Topological versions of passy– prisman’S minimax theorem
inferred← citeshttps://doi.org/10.1080/02331930008844474openalex-snapshot
Toward A geometric theory of minimax equalities
inferred← citeshttps://doi.org/10.1080/02331930410001695283openalex-snapshot
-convexity
inferred← citeshttps://doi.org/10.1080/02331939708844289openalex-snapshot
A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
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.