On the public citation graph
Directional differentiability of optimal solutions under Slater's condition
0 signed · 63 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/978-3-0348-6328-5openalex-snapshot
Non-Linear Parametric Optimization
inferredcites →https://doi.org/10.1007/978-3-0348-6328-5_6openalex-snapshot
On Procedures for Analysing Parametric Optimization Problems
inferredcites →https://doi.org/10.1007/bf00938795openalex-snapshot
A semistrong sufficiency condition for optimality in nonconvex programming and its connection to the perturbation problem
inferredcites →https://doi.org/10.1007/bf01442236openalex-snapshot
Approximation to a set-valued mapping, I: A proposal
inferredcites →https://doi.org/10.1007/bf01581199openalex-snapshot
Sensitivity analysis for nonsmooth generalized equations
inferredcites →https://doi.org/10.1007/bf01584378openalex-snapshot
Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs
inferredcites →https://doi.org/10.1007/bf01584382openalex-snapshot
Differentiability with respect to parameters of solutions to convex programming problems
inferredcites →https://doi.org/10.1007/bf01588782openalex-snapshot
Implicit functions and sensitivity of stationary points
inferredcites →https://doi.org/10.1007/bf01593771openalex-snapshot
An algorithm for determining all extreme points of a convex polytope
inferredcites →https://doi.org/10.1007/bf01593777openalex-snapshot
A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
inferredcites →https://doi.org/10.1007/bf02253895openalex-snapshot
A globally convergent algorithm based on imbedding and parametric optimization
inferredcites →https://doi.org/10.1007/bfb0120989openalex-snapshot
Generalized equations and their solutions, part II: Applications to nonlinear programming
inferredcites →https://doi.org/10.1007/bfb0121214openalex-snapshot
Directional derivative of the marginal function in nonlinear programming
inferredcites →https://doi.org/10.1007/bfb0121215openalex-snapshot
Solution point differentiability without strict complementarity in nonlinear programming
inferredcites →https://doi.org/10.1016/0022-247x(67)90163-1openalex-snapshot
The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
inferredcites →https://doi.org/10.1016/b978-0-12-590240-3.50009-4openalex-snapshot
Strongly Stable Stationary Solutions in Nonlinear Programs
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6041-2openalex-snapshot
Introduction to Sensitivity and Stability Analysis in Nonlinear Programming
inferredcites →https://doi.org/10.1080/02331938908843460openalex-snapshot
On the directional derivative of the optimal solution mapping without linear independence constraint qualification
inferredcites →https://doi.org/10.1080/02331939108843679openalex-snapshot
Corrigendum: “on the directional derivative of the optimal solution mapping without linear independence constraint qualification” of S. Dempe (optimization 20 (1989) 4 401–414)
inferredcites →https://doi.org/10.1137/0324068openalex-snapshot
Lipschitzian Solutions of Perturbed Nonlinear Programming Problems
inferredcites →https://doi.org/10.1137/0326037openalex-snapshot
Sensitivity Analysis of Nonlinear Programs and Differentiability Properties of Metric Projections
inferredcites →https://doi.org/10.1287/moor.13.4.629openalex-snapshot
Directional Behaviour of Optimal Solutions in Nonlinear Mathematical Programming
inferredcites →https://doi.org/10.1287/moor.5.1.43openalex-snapshot
Strongly Regular Generalized Equations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_36openalex-snapshot
Bilevel Programming: Implicit Function Approach
inferred← citeshttps://doi.org/10.1007/0-387-34221-4_1openalex-snapshot
Optimality conditions for bilevel programming problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_44openalex-snapshot
Bilevel Programming: Implicit Function Approach
inferred← citeshttps://doi.org/10.1007/978-1-4613-0307-7_12openalex-snapshot
An Implicit Function Approach to Bilevel Programming Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_44-1openalex-snapshot
Bilevel Programming: Implicit Function Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-58409-1_6openalex-snapshot
Properties of Some Convex Marginal Functions Without Constant Rank Regularity
inferred← citeshttps://doi.org/10.1007/bf00247793openalex-snapshot
On an algorithm solving two-level programming problems with nonunique lower level solutions
inferred← citeshttps://doi.org/10.1007/bf01585934openalex-snapshot
Directional derivatives of the solution of a parametric nonlinear program
inferred← citeshttps://doi.org/10.1007/s10107-009-0288-3openalex-snapshot
Implications of the constant rank constraint qualification
inferred← citeshttps://doi.org/10.1007/s10479-011-1023-zopenalex-snapshot
Bilevel road pricing: theoretical analysis and optimality conditions
inferred← citeshttps://doi.org/10.1007/s10589-015-9729-5openalex-snapshot
A collision detection approach for maximizing the material utilization
inferred← citeshttps://doi.org/10.1007/s41478-026-01124-7openalex-snapshot
Second-order directional derivatives of the optimal solution function in parametric programming problems
inferred← citeshttps://doi.org/10.1016/j.cmpb.2020.105337openalex-snapshot
Bregmannian consensus clustering for cancer subtypes analysis
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107218openalex-snapshot
Exact and matheuristic algorithms for robust lot-sizing and scheduling problems with uncertain capacity
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.06.036openalex-snapshot
Improving the performance of a traffic system by fair rerouting of travelers
inferred← citeshttps://doi.org/10.1023/a:1008735010803openalex-snapshot
A Bundle Algorithm Applied to Bilevel Programming Problems with Non-Unique Lower Level Solutions
inferred← citeshttps://doi.org/10.1023/a:1023669004408openalex-snapshot
Multivalued Analysis and Differential Properties of Multivalued Mappings
inferred← citeshttps://doi.org/10.1080/02331930108844570openalex-snapshot
The generalized jacobian of the optimal solution in parametric optimization
inferred← citeshttps://doi.org/10.1080/02331934.2018.1517159openalex-snapshot
Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs
inferred← citeshttps://doi.org/10.1080/02331939208843831openalex-snapshot
A necessary and a sufficient optimality condition for bilevel programming problems
inferred← citeshttps://doi.org/10.1080/02331939508844061openalex-snapshot
Computing optimal incentives via bilevel programming
inferred← citeshttps://doi.org/10.1080/02331939708844295openalex-snapshot
Quasidifferntiability of optimal solutions in parametric optimal solutions in parametric nonlinear optimization
inferred← citeshttps://doi.org/10.1080/03052150500229418openalex-snapshot
A closed formula for local sensitivity analysis in mathematical programming
inferred← citeshttps://doi.org/10.1080/09720502.2002.10700313openalex-snapshot
Sensitivity analysis for variational inequalities
inferred← citeshttps://doi.org/10.1109/cdc57313.2025.11313011openalex-snapshot
Feasibility Informed Advantage Weighted Regression for Persistent Safety in Offline Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/lcsys.2021.3136813openalex-snapshot
Guaranteed Safe Spacecraft Docking With Control Barrier Functions
inferred← citeshttps://doi.org/10.1109/ojcoms.2021.3071853openalex-snapshot
Effective Collaboration to Maximize Throughput Based on Multiuser Cooperative Mobility in Social-Physical Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/tnet.2019.2946481openalex-snapshot
Optimizing Information Freshness in Wireless Networks Under General Interference Constraints
inferred← citeshttps://doi.org/10.1109/tpwrs.2020.3038076openalex-snapshot
Water-Energy Nexus Management for Power Systems
inferred← citeshttps://doi.org/10.1109/tpwrs.2020.3043757openalex-snapshot
A Cyber-Secured Operation for Water-Energy Nexus
inferred← citeshttps://doi.org/10.1137/17m1120385openalex-snapshot
Generalized Sensitivity Analysis of Nonlinear Programs
inferred← citeshttps://doi.org/10.1287/moor.1090.0431openalex-snapshot
Variational Conditions Under the Constant Rank Constraint Qualification
inferred← citeshttps://doi.org/10.1287/moor.21.2.401openalex-snapshot
Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
inferred← citeshttps://doi.org/10.1920/wp.cem.2019.6819openalex-snapshot
Robust likelihood ratio tests for incomplete economic models
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.