On the public citation graph
Duality in nonlinear programming and the minimax theorem
0 signed · 54 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.1049/sqj.1960.0014openalex-snapshot
Mathematical Programming and Electrical Networks
inferredcites →https://doi.org/10.1090/qam/135625openalex-snapshot
A duality theorem for non-linear programming
inferredcites →https://doi.org/10.1111/j.1467-842x.1961.tb00310.xopenalex-snapshot
A DUALITY THEOREM IN NON‐LINEAR PROGRAMMING WITH NON‐LINEAR CONSTRAINTS1
inferredcites →https://doi.org/10.1147/rd.44.0407openalex-snapshot
A Duality Theorem for Convex Programs
inferredcites →https://doi.org/10.1147/rd.61.0137openalex-snapshot
Dual Programs [Letter to the Editor]
inferredcites →https://doi.org/10.1215/s0012-7094-41-00838-4openalex-snapshot
A generalization of Brouwer’s fixed point theorem
inferredcites →https://doi.org/10.1515/9781400882229-003openalex-snapshot
Annals of Mathematics Studies
inferredcites →https://doi.org/10.2307/2003933openalex-snapshot
Mathematical Programming and Electrical Networks
inferredcites →https://doi.org/10.2307/2342482openalex-snapshot
Mathematical Methods and Theory in Games, Programming, and Economics.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1520-6750(199508)42:5<773::aid-nav3220420505>3.0.co;2-fopenalex-snapshot
Strategic investment to reduce setup times in the economic lot scheduling problem
inferred← citeshttps://doi.org/10.1002/zamm.19850650715openalex-snapshot
Maximin Problem and a Duality Theorem for Mixed‐Integer Quadratic Programming
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/bf01386054openalex-snapshot
�ber einen Dualit�tssatz der nichtlinearen programmierung
inferred← citeshttps://doi.org/10.1007/bf01919547openalex-snapshot
Duale Optimierungsaufgaben und Sattelpunktsätze
inferred← citeshttps://doi.org/10.1007/bf01949709openalex-snapshot
Eine allgemeine, symmetrische Formulierung des Dekompositionsprinzips für duale Paare nichtlinearer Minmax- und Maxmin-Probleme
inferred← citeshttps://doi.org/10.1007/bf02165001openalex-snapshot
Abschätzungen bei Variationsmethoden mit Hilfe von Dualitätssätzen. II
inferred← citeshttps://doi.org/10.1007/bf02165309openalex-snapshot
Abschätzungen bei Variationsmethoden mit Hilfe von Dualitätssätzen. I
inferred← citeshttps://doi.org/10.1007/bf02277180openalex-snapshot
Piecewise linear optimization: Duality and numerical results
inferred← citeshttps://doi.org/10.1016/0022-0531(74)90097-0openalex-snapshot
Duality: A symmetric approach from the economist's vantage point
inferred← citeshttps://doi.org/10.1016/0022-247x(65)90101-0openalex-snapshot
Minmax and duality in nonlinear programming
inferred← citeshttps://doi.org/10.1016/0022-247x(67)90095-9openalex-snapshot
Strictly quasi-convex (concave) functions and duality in mathematical programming
inferred← citeshttps://doi.org/10.1016/0022-247x(90)90216-3openalex-snapshot
Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints
inferred← citeshttps://doi.org/10.1016/0377-2217(86)90194-3openalex-snapshot
Symmetric duality for disjunctive programming with absolute value functionals
inferred← citeshttps://doi.org/10.1016/0377-2217(87)90161-5openalex-snapshot
Symmetric duality for disjunctive programming with absolute value functionals
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90260-topenalex-snapshot
Implied constraints and a unified theory of duality in linear and nonlinear programming
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.11.028openalex-snapshot
Lagrangean Relaxation Parallel Method for Optimizing of a Hydroelectric Generation System
inferred← citeshttps://doi.org/10.1016/j.mcm.2007.07.004openalex-snapshot
Application of continuous-time programming problems to a class of variational-type inequalities
inferred← citeshttps://doi.org/10.1016/j.orl.2013.05.001openalex-snapshot
Sequential stochastic core of a cooperative stochastic programming game
inferred← citeshttps://doi.org/10.1017/s1446788700028937openalex-snapshot
Proper efficiency and duality for vector valued optimization problems
inferred← citeshttps://doi.org/10.1051/m2an/196802r300271openalex-snapshot
Programmes linéaires d'appui d'un programme convexe, application aux conditions d'optimalité et à la dualité
inferred← citeshttps://doi.org/10.1051/m2an/197105r200031openalex-snapshot
Stability and duality in convex minimization problems
inferred← citeshttps://doi.org/10.1080/09720510.1998.10700978openalex-snapshot
Optimality principles and duality models for a class of continuous-time generalized fractional programming problems with operator constraints
inferred← citeshttps://doi.org/10.1109/tac.2016.2585919openalex-snapshot
Control Under Stochastic Multiplicative Uncertainties: Part I, Fundamental Conditions of Stabilizability
inferred← citeshttps://doi.org/10.1109/tac.2024.3362700openalex-snapshot
Mean-Square Stability Radii for Stochastic Robustness Analysis: A Frequency-Domain Approach
inferred← citeshttps://doi.org/10.1109/tssc.1968.300135openalex-snapshot
Duality and Decomposition in Mathematical Programming
inferred← citeshttps://doi.org/10.1111/j.1467-999x.1973.tb00204.xopenalex-snapshot
ON A THEOREM OF NEGISHI
inferred← citeshttps://doi.org/10.1137/0114036openalex-snapshot
Self-Duality in Mathematical Programming
inferred← citeshttps://doi.org/10.1137/0305018openalex-snapshot
On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
inferred← citeshttps://doi.org/10.1137/0313045openalex-snapshot
Unconstrained Lagrangians in Nonlinear Programming
inferred← citeshttps://doi.org/10.1137/1013001openalex-snapshot
Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
inferred← citeshttps://doi.org/10.1287/mnsc.13.5.344openalex-snapshot
Non-Linear Programming Via Penalty Functions
inferred← citeshttps://doi.org/10.1287/mnsc.15.7.416openalex-snapshot
Mathematical Programming with Increasing Constraint Functions
inferred← citeshttps://doi.org/10.1287/moor.10.2.263openalex-snapshot
The Entropic Penalty Approach to Stochastic Programming
inferred← citeshttps://doi.org/10.1287/moor.19.1.238openalex-snapshot
Theorems of the Alternative and Duality for INF-SUP Problems
inferred← citeshttps://doi.org/10.1287/opre.15.6.1068openalex-snapshot
A Decomposable Nonlinear Programming Approach
inferred← citeshttps://doi.org/10.1287/opre.23.3.434openalex-snapshot
Surrogate Constraint Duality in Mathematical Programming
inferred← citeshttps://doi.org/10.7146/math.scand.a-10714openalex-snapshot
Minimax Theorems and Conjugate Saddle-Functions.
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.