On the public citation graph
Necessary optimality conditions for Stackelberg problems
0 signed · 92 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/10957.1573-2878openalex-snapshot
Journal of Optimization Theory and Applications
inferredcites →https://doi.org/10.1007/bf00935665openalex-snapshot
On the Stackelberg strategy in nonzero-sum games
inferredcites →https://doi.org/10.1007/bf00938947openalex-snapshot
Lipschitz properties of solutions in mathematical programming
inferredcites →https://doi.org/10.1007/bf00940846openalex-snapshot
A theoretical approximation scheme for Stackelberg problems
inferredcites →https://doi.org/10.1007/bf01416737openalex-snapshot
On the numerical solution of a class of Stackelberg problems
inferredcites →https://doi.org/10.1007/bf01580677openalex-snapshot
Sensitivity analysis for nonlinear programming using penalty methods
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/bf02022087openalex-snapshot
NLPQL: A fortran subroutine solving constrained nonlinear programming problems
inferredcites →https://doi.org/10.1007/bfb0113303openalex-snapshot
A nondifferentiable approach to the solution of optimum design problems with variational inequalities
inferredcites →https://doi.org/10.1007/bfb0121215openalex-snapshot
Solution point differentiability without strict complementarity in nonlinear programming
inferredcites →https://doi.org/10.1016/0022-1236(76)90017-3openalex-snapshot
Contrôle dans les inéquations variationelles elliptiques
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6169-7openalex-snapshot
Dynamic Noncooperative Game Theory
inferredcites →https://doi.org/10.1109/tac.1981.1102607openalex-snapshot
A new computational method for Stackelberg and min-max problems by use of a penalty method
inferredcites →https://doi.org/10.1137/0322028openalex-snapshot
Optimal Control in Some Variational Inequalities
inferredcites →https://doi.org/10.1137/0326016openalex-snapshot
Optimal Control of Strongly Monotone Variational Inequalities
inferredcites →https://doi.org/10.1137/0328012openalex-snapshot
Erratum: Optimal Control of Strongly Monotone Variational Inequalities
inferredcites →https://doi.org/10.1137/0802008openalex-snapshot
A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1287/moor.15.2.286openalex-snapshot
Sensitivity Analysis for Nonlinear Programs and Variational Inequalities with Nonunique Multipliers
inferredcites →https://doi.org/10.1287/moor.4.1.79openalex-snapshot
Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
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-306-48332-7_39openalex-snapshot
Bilevel Programming: Optimality Conditions and Duality
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-0-387-74759-0_47openalex-snapshot
Bilevel Programming: Optimality Conditions and Duality
inferred← citeshttps://doi.org/10.1007/978-0-387-75714-8_6openalex-snapshot
Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4419-9640-4_15openalex-snapshot
Variational Inequalities and Optimistic Bilevel Programming Problem Via Convexifactors
inferred← citeshttps://doi.org/10.1007/978-1-4613-0307-7_4openalex-snapshot
Optimal Structural Design in Nonsmooth Mechanics
inferred← citeshttps://doi.org/10.1007/978-1-4614-9035-7_15openalex-snapshot
Pricing of Energy Contracts: From Replication Pricing to Swing Options
inferred← citeshttps://doi.org/10.1007/978-1-4757-3623-6_7openalex-snapshot
Pseudomonotone and Implicit Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-50089-4_7openalex-snapshot
A Service Location Model in a Bi-level Structure
inferred← citeshttps://doi.org/10.1007/978-3-030-52119-6_19openalex-snapshot
BOLIB: Bilevel Optimization LIBrary of Test Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-52119-6_20openalex-snapshot
Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
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-94-009-0369-2_12openalex-snapshot
A Condensed Introduction to Bundle Methods in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/bf00121269openalex-snapshot
Weak via strong Stackelberg problem: New results
inferred← citeshttps://doi.org/10.1007/bf00786690openalex-snapshot
Optimal prestress of structures with frictional unilateral contact interfaces
inferred← citeshttps://doi.org/10.1007/bf01096458openalex-snapshot
Bilevel and multilevel programming: A bibliography review
inferred← citeshttps://doi.org/10.1007/bf01585759openalex-snapshot
A numerical approach to optimization problems with variational inequality constraints
inferred← citeshttps://doi.org/10.1007/bfb0035462openalex-snapshot
Stability and sensitivity analysis of solutions to infinite-dimensional optimization problems
inferred← citeshttps://doi.org/10.1007/bfb0035468openalex-snapshot
A numerical approach to the design of masonry structures
inferred← citeshttps://doi.org/10.1007/s10013-025-00776-5openalex-snapshot
On Weakened MFCQ for a Specific Multiobjective Bilevel Optimal Control Problem
inferred← citeshttps://doi.org/10.1007/s10288-005-0071-0openalex-snapshot
Bilevel programming: A survey
inferred← citeshttps://doi.org/10.1007/s10479-006-6159-xopenalex-snapshot
Extending the stochastic programming framework for the modeling of several decision makers: pricing and competition in the telecommunication sector
inferred← citeshttps://doi.org/10.1007/s10479-007-0176-2openalex-snapshot
An overview of bilevel optimization
inferred← citeshttps://doi.org/10.1007/s10479-025-07009-5openalex-snapshot
Sufficiency and duality in a multi-objective bilevel programming model
inferred← citeshttps://doi.org/10.1007/s10898-005-1650-5openalex-snapshot
Necessary Optimality Conditions for Bilevel Optimization Problems Using Convexificators
inferred← citeshttps://doi.org/10.1007/s10898-007-9154-0openalex-snapshot
Necessary optimality conditions for bilevel set optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-009-9468-1openalex-snapshot
Second order optimality conditions for bilevel set optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-014-0200-4openalex-snapshot
Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
inferred← citeshttps://doi.org/10.1007/s10898-026-01599-5openalex-snapshot
On relation between bilevel programming problems and variational inequalities on hadamard manifolds with application to toll optimization problem
inferred← citeshttps://doi.org/10.1007/s10957-011-9819-1openalex-snapshot
Optimality and Duality Results for Bilevel Programming Problem Using Convexifactors
inferred← citeshttps://doi.org/10.1007/s10957-011-9941-0openalex-snapshot
Optimality Conditions for Optimistic Bilevel Programming Problem Using Convexifactors
inferred← citeshttps://doi.org/10.1007/s10957-012-0046-1openalex-snapshot
Necessary Optimality Conditions and a New Approach to Multiobjective Bilevel Optimization Problems
inferred← citeshttps://doi.org/10.1007/s11117-017-0511-zopenalex-snapshot
An equivalent one level optimization problem to a semivectorial bilevel problem
inferred← citeshttps://doi.org/10.1007/s11117-019-00685-1openalex-snapshot
New optimality conditions and a scalarization approach for a nonconvex semi-vectorial bilevel optimization problem
inferred← citeshttps://doi.org/10.1007/s11117-019-00723-yopenalex-snapshot
Necessary optimality conditions for a semivectorial bilevel optimization problem using the kth-objective weighted-constraint approach
inferred← citeshttps://doi.org/10.1007/s11590-019-01443-8openalex-snapshot
New optimality conditions for bilevel programs by using an exact separation principle
inferred← citeshttps://doi.org/10.1007/s11590-026-02331-8openalex-snapshot
Pricing semi-cooperation in unstable linear–linear bilevel programs via strictly convex tie-breaking and stability contracts
inferred← citeshttps://doi.org/10.1016/0045-7825(94)00739-aopenalex-snapshot
Optimal prestress of cracked unilateral structures: finite element analysis of an optimal control problem for variational inequalities
inferred← citeshttps://doi.org/10.1016/0362-546x(93)90048-wopenalex-snapshot
Shape optimization in unilateral contact problems using generalized reciprocal energy as objective functional
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.12.029openalex-snapshot
Electricity swing option pricing by stochastic bilevel optimization: A survey and new approaches
inferred← citeshttps://doi.org/10.1016/j.jmaa.2021.125932openalex-snapshot
Second order optimality conditions for a bilevel optimization problem in terms of approximate Hessians
inferred← citeshttps://doi.org/10.1023/a:1017592429235openalex-snapshot
Exact Penalty Functions for Convex Bilevel Programming Problems
inferred← citeshttps://doi.org/10.1080/01630563.2018.1488141openalex-snapshot
Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem
inferred← citeshttps://doi.org/10.1080/0233193031000149894openalex-snapshot
Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1080/02331930701761508openalex-snapshot
Necessary optimality conditions of a D.C. set-valued bilevel optimization problem
inferred← citeshttps://doi.org/10.1080/02331931003596725openalex-snapshot
Optimality results for a specific bilevel optimization problem
inferred← citeshttps://doi.org/10.1080/02331934.2012.718346openalex-snapshot
A new equivalent single-level problem for bilevel problems
inferred← citeshttps://doi.org/10.1080/02331934.2018.1523402openalex-snapshot
Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation
inferred← citeshttps://doi.org/10.1080/02331934.2020.1750610openalex-snapshot
Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
inferred← citeshttps://doi.org/10.1080/02331934.2022.2089036openalex-snapshot
Applying directional upper semi-regular convexificators in bilevel optimization
inferred← citeshttps://doi.org/10.1080/02331939408844010openalex-snapshot
Optimality conditions and an algorithm for linear-quadratic bilevel programs$fr1:1$f:1partially supported by nsfc and madis. this paper was prepared during the first author's visiting universitat de barcelona. he is grateful to the financial support provided by universitat de barcelona. the…
inferred← citeshttps://doi.org/10.1080/02331939508844060openalex-snapshot
Optimality conditions for bilevel programming problems
inferred← citeshttps://doi.org/10.1109/tevc.2017.2712906openalex-snapshot
A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications
inferred← citeshttps://doi.org/10.1137/0804019openalex-snapshot
On Optimization Problems with Variational Inequality Constraints
inferred← citeshttps://doi.org/10.1137/s0036144595285963openalex-snapshot
Engineering and Economic Applications of Complementarity Problems
inferred← citeshttps://doi.org/10.1137/s1052623493257344openalex-snapshot
Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
inferred← citeshttps://doi.org/10.1145/3071178.3071244openalex-snapshot
Handling practicalities in agricultural policy optimization for water quality improvements
inferred← citeshttps://doi.org/10.1145/3357384.3357933openalex-snapshot
Rating Mechanisms for Sustainability of Crowdsourcing Platforms
inferred← citeshttps://doi.org/10.1155/2015/310301openalex-snapshot
Bilevel Programming and Applications
inferred← citeshttps://doi.org/10.1287/moor.1060.0219openalex-snapshot
Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
inferred← citeshttps://doi.org/10.1287/moor.22.4.977openalex-snapshot
Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
inferred← citeshttps://doi.org/10.23952/jnva.4.2020.3.05openalex-snapshot
Efficiency conditions for multiobjective bilevel programming problems via convexificators
inferred← citeshttps://doi.org/10.3390/axioms13060371openalex-snapshot
On Approximate Variational Inequalities and Bilevel Programming Problems
inferred← citeshttps://doi.org/10.3934/jimo.2020114openalex-snapshot
Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem
inferred← citeshttps://doi.org/10.4236/sgre.2010.11009openalex-snapshot
A MPCC-NLP Approach for an Electric Power Market Problem
inferred← citeshttps://doi.org/10.5556/j.tkjm.54.2023.3830openalex-snapshot
Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem
inferred← citeshttps://doi.org/10.70675/6e5d61fdzd008z4d62zbe63z45bd7cf5e48bopenalex-snapshot
Multi-leader-follower models : theoretical analysis, simulation, and application to eco-industrial parks
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.