On the public citation graph
Implicit function theorems for mathematical programming and for systems of inequalities
0 signed · 38 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.1016/0022-247x(67)90139-4openalex-snapshot
On the continuity of the minimum set of a continuous function
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1137/0111006openalex-snapshot
Marginal Values in Linear Programming
inferredcites →https://doi.org/10.1137/0113020openalex-snapshot
Mass Action Laws and the Gibbs Free Energy Function
inferredcites →https://doi.org/10.1515/9781400881987-009openalex-snapshot
8. Marginal Values of Matrix Games and Linear Programs
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-94-015-8330-5_18openalex-snapshot
Directional Second Derivative of the Regularized Function That Smoothes the Min-Max Problem
inferred← citeshttps://doi.org/10.1007/bf00934363openalex-snapshot
Sensitivity analysis in geometric programming
inferred← citeshttps://doi.org/10.1007/bf00938948openalex-snapshot
Differential sensitivity of solutions of convex constrained optimal control problems for discrete systems
inferred← citeshttps://doi.org/10.1007/bf00939331openalex-snapshot
Sensitivity analysis in posynomial geometric programming
inferred← citeshttps://doi.org/10.1007/bf01580677openalex-snapshot
Sensitivity analysis for nonlinear programming using penalty methods
inferred← citeshttps://doi.org/10.1007/bf01584378openalex-snapshot
Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs
inferred← citeshttps://doi.org/10.1007/bf01609031openalex-snapshot
An implementation of some implicit function theorems with applications to sensitivity analysis
inferred← citeshttps://doi.org/10.1007/bf02055189openalex-snapshot
Sensitivity analysis in geometric programming: Theory and computations
inferred← citeshttps://doi.org/10.1007/bf02055196openalex-snapshot
Sensitivity and stability analysis for nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf02055198openalex-snapshot
On parametric nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf02612713openalex-snapshot
Stability in stochastic programming with recourse-estimated parameters
inferred← citeshttps://doi.org/10.1007/bfb0042783openalex-snapshot
Higher order sensitivity of solutions to convex programming problems without strict complementarity
inferred← citeshttps://doi.org/10.1007/bfb0043393openalex-snapshot
Sensitivity analysis in nonlinear programming under second order assumptions
inferred← citeshttps://doi.org/10.1007/bfb0121215openalex-snapshot
Solution point differentiability without strict complementarity in nonlinear programming
inferred← citeshttps://doi.org/10.1007/s00454-003-0006-7openalex-snapshot
Blowing Up Polygonal Linkages
inferred← citeshttps://doi.org/10.1016/0098-1354(90)87007-copenalex-snapshot
Bilevel programming for steady-state chemical process design—I. Fundamentals and algorithms
inferred← citeshttps://doi.org/10.1016/0305-0548(82)90004-1openalex-snapshot
Basic results in the development of sensitivity and stability analysis in nonlinear programming
inferred← citeshttps://doi.org/10.1016/j.jprocont.2016.05.002openalex-snapshot
Fast NMPC schemes for regulatory and economic NMPC – A review
inferred← citeshttps://doi.org/10.1063/1.438530openalex-snapshot
Further developments and applications of the Green’s function method of sensitivity analysis in chemical kinetics
inferred← citeshttps://doi.org/10.1068/a090085openalex-snapshot
Sensitivity Analysis of Regional Planning Models
inferred← citeshttps://doi.org/10.1080/02331938908843460openalex-snapshot
On the directional derivative of the optimal solution mapping without linear independence constraint qualification
inferred← citeshttps://doi.org/10.1080/02331939008843555openalex-snapshot
First and Second Order Sensitivity Analysis of Nonlinear Programs under Directional Constraint Qualification Conditions
inferred← citeshttps://doi.org/10.1080/15598608.2014.847763openalex-snapshot
Asymptotic Normality of the Optimal Solution in Response Surface Methodology
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892131openalex-snapshot
Straightening polygonal arcs and convexifying polygonal cycles
inferred← citeshttps://doi.org/10.1137/0322033openalex-snapshot
Differentiability of Relations and Differential Stability of Perturbed Optimization Problems
inferred← citeshttps://doi.org/10.1137/0326037openalex-snapshot
Sensitivity Analysis of Nonlinear Programs and Differentiability Properties of Metric Projections
inferred← citeshttps://doi.org/10.1137/0804001openalex-snapshot
On Sensitivity Analysis of Nonlinear Programs in Banach Spaces: The Approach via Composite Unconstrained Optimization
inferred← citeshttps://doi.org/10.1137/090751025openalex-snapshot
A Nonsmooth Newton Method with Path Search and Its Use in Solving $C^{1,1}$ Programs and Semi-Infinite Problems
inferred← citeshttps://doi.org/10.1145/355769.355770openalex-snapshot
Sensitivity Analysis Procedures for Geometric Programs: Computational Aspects
inferred← citeshttps://doi.org/10.1287/mnsc.25.6.555openalex-snapshot
Constrained Entropy Models; Solvability and Sensitivity
inferred← citeshttps://doi.org/10.1287/moor.10.2.207openalex-snapshot
Second-Order Derivatives of Extremal-Value Functions and Optimality Conditions for Semi-Infinite Programs
inferred← citeshttps://doi.org/10.2514/3.48671openalex-snapshot
Sensitivity Analysis of Discrete Structural Systems
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.