On the numerical solution of a class of Stackelberg problems
From MaRDI portal
differentiability of marginal functionselliptic variational inequalitygeneralized gradientsgeneralized Jacobiansnondifferentiable optimizationnonsmooth analysisoptimum designset-valued mapsstabilityStackelberg problem
Variational inequalities (49J40) Nonsmooth analysis (49J52) Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Convex programming (90C25) Hierarchical games (including Stackelberg games) (91A65) Hierarchical systems (93A13)
Recommendations
- Necessary optimality conditions for Stackelberg problems
- scientific article; zbMATH DE number 19349
- A solution method for the static constrained Stackelberg problem via penalty method
- A theoretical approximation scheme for Stackelberg problems
- New approach to linear Stackelberg problems with multiple leaders-follower
Cites work
- A new computational method for Stackelberg and min-max problems by use of a penalty method
- Differentiability with respect to parameters of solutions to convex programming problems
- Differential properties of the marginal function in mathematical programming
- Directional differentiability of the optimal value function in a nonlinear programming problem
- Dynamic noncooperative game theory
- Gradients Généralisés de Fonctions Marginales
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 4044567 (Why is no real title available?)
- scientific article; zbMATH DE number 4083400 (Why is no real title available?)
- scientific article; zbMATH DE number 3791104 (Why is no real title available?)
- scientific article; zbMATH DE number 193559 (Why is no real title available?)
- Lipschitz Continuity for Constrained Processes
- Methods of descent for nondifferentiable optimization
- On Generalized Gradients in Optimization Problems with Set-Valued Constraints
- Optimization and nonsmooth analysis
- Solution point differentiability without strict complementarity in nonlinear programming
Cited in
(85)- A theoretical approximation scheme for Stackelberg problems
- Necessary optimality conditions for Stackelberg problems
- Bilevel and multilevel programming: A bibliography review
- On bilevel programs with a convex lower-level problem violating Slater's constraint qualification
- Determination of Stackelberg-Nash equilibria using a sensitivity based approach
- A bridge between bilevel programs and Nash games
- Solving discrete linear bilevel optimization problems using the optimal value reformulation
- Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems
- New necessary and sufficient optimality conditions for strong bilevel programming problems
- Large-scale unit commitment under uncertainty: an updated literature survey
- Statistics with set-valued functions: applications to inverse approximate optimization
- Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping
- A dynamic reformulation heuristic for generalized interdiction problems
- Bilevel road pricing: theoretical analysis and optimality conditions
- A numerical approach to optimization problems with variational inequality constraints
- Weak via strong Stackelberg problem: New results
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Convexification method for bilevel programs with a nonconvex Follower's problem
- Numerically tractable optimistic bilevel problems
- Bilevel programming approaches to production planning for multiple products with short life cycles
- Single-level reformulations of a specific non-smooth bilevel programming problem and their applications
- Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs
- Solving inverse optimal control problems via value functions to global optimality
- On solving simple bilevel programs with a nonconvex lower level program
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
- Modeling and solving the benchmark case in a differentiated Stackelberg duopoly
- On calmness conditions in convex bilevel programming
- A solution method for the static constrained Stackelberg problem via penalty method
- Solution algorithm for an optimistic linear Stackelberg problem
- scientific article; zbMATH DE number 19349 (Why is no real title available?)
- Variational analysis of marginal functions with applications to bilevel programming
- scientific article; zbMATH DE number 1487887 (Why is no real title available?)
- Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs
- Optimality conditions for special semidefinite bilevel optimization problems
- Shape optimisation with the level set method for contact problems in linearised elasticity
- On a three-level competitive pricing problem with uniform and mill pricing strategies
- Interactions between bilevel optimization and Nash games
- Regularization and approximation methods in Stackelberg games and bilevel optimization
- Bilevel optimization and variational analysis
- Constraint qualifications and optimality conditions in bilevel optimization
- BOLIB: bilevel Optimization LIBrary of test problems
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Some new optimality conditions for semivector bilevel optimization program
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- Generic property of the partial calmness condition for bilevel programming problems
- Directional necessary optimality conditions for bilevel programs
- First- and second-order optimality conditions in optimistic bilevel set-valued programming
- A nonsmooth Stackelberg equilibrium problem via mixed variational inequalities
- A Lagrange multiplier expression method for bilevel polynomial optimization
- Necessary optimality conditions in pessimistic bilevel programming
- Bilevel polynomial programs and semidefinite relaxation methods
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
- New necessary optimality conditions in optimistic bilevel programming
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- A solution method for the linear static Stackelberg problem using penalty functions
- Focus programming: a bi‐level programming approach to static stochastic optimization problems
- Applying directional upper semi-regular convexificators in bilevel optimization
- Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods
- A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming
- Estimates for coderivative of solution map in bilevel program
- scientific article; zbMATH DE number 7733454 (Why is no real title available?)
- Branch-and-cut solution approach for multilevel mixed integer linear programming problems
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- Necessary optimality conditions for bilevel minimization problems
- Applying tangential subdifferentials in bilevel optimization
- Notes on the value function approach to multiobjective bilevel optimization
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- A gentle introduction to algorithms for bilevel optimization from machine learning
- Necessary optimality conditions for nonsmooth multiobjective bilevel programs using the Drummond-Svaiter functional
- Solving a class of bilevel programming problems by DC programming and DCA
- Near-optimal nonconvex-strongly-convex bilevel optimization with fully first-order oracles
- Necessary optimality conditions for strictly robust bilevel optimization problems
- Second-order optimality conditions for bi-local solutions of bilevel programs
- Optimality conditions for bilevel programmes via Moreau envelope reformulation*
- Optimality conditions for a class of nonsmooth semidefinite bilevel optimization problems via convexifications applied to bilevel supply chain under uncertainty
- On construction of subgame perfect Nash equilibria in Stackelberg games
- Necessary optimality conditions for a bilevel multiobjective problem in terms of approximations
- Duality-based single-level reformulations of bilevel optimization problems
- Sufficiency and duality criteria in tangential subdifferential governed bilevel multi-objective extremization models
- Bilevel optimization with sustainability perspective: a survey on applications
- Optimizing power generation in the presence of micro-grids
- On stability in optimistic bilevel optimization
- Second-order optimality conditions for nonsmooth constrained optimization with applications to bilevel programming
- The rate of convergence of augmented Lagrangian method for bilevel optimization problems with equality constraints
- A smoothing augmented Lagrangian method for solving simple bilevel programs
This page was built for publication: On the numerical solution of a class of Stackelberg problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3200889)
