On the numerical solution of a class of Stackelberg problems
From MaRDI portal
DOI10.1007/BF01416737zbMATH Open0714.90077OpenAlexW2028130620MaRDI QIDQ3200889FDOQ3200889
Authors: Jiří Outrata 
Publication date: 1990
Published in: ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01416737
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
stabilitygeneralized gradientsnonsmooth analysisset-valued mapselliptic variational inequalitynondifferentiable optimizationoptimum designgeneralized JacobiansStackelberg problemdifferentiability of marginal functions
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonsmooth analysis (49J52) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Variational inequalities (49J40) Hierarchical games (including Stackelberg games) (91A65) Hierarchical systems (93A13)
Cites Work
- Dynamic noncooperative game theory
- Methods of descent for nondifferentiable optimization
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lipschitz Continuity for Constrained Processes
- Differential properties of the marginal function in mathematical programming
- Title not available (Why is that?)
- Solution point differentiability without strict complementarity in nonlinear programming
- Title not available (Why is that?)
- Directional differentiability of the optimal value function in a nonlinear programming problem
- Gradients Généralisés de Fonctions Marginales
- 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
- On Generalized Gradients in Optimization Problems with Set-Valued Constraints
Cited In (69)
- First- and second-order optimality conditions in optimistic bilevel set-valued programming
- Title not available (Why is that?)
- Estimates for coderivative of solution map in bilevel program
- Applying tangential subdifferentials in bilevel optimization
- Notes on the value function approach to multiobjective bilevel optimization
- Focus programming: a bi‐level programming approach to static stochastic optimization problems
- Branch-and-cut solution approach for multilevel mixed integer linear programming problems
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods
- A gentle introduction to algorithms for bilevel optimization from machine learning
- Necessary optimality conditions in pessimistic bilevel programming
- A numerical approach to optimization problems with variational inequality constraints
- BOLIB: bilevel Optimization LIBrary of test problems
- Variational analysis of marginal functions with applications to bilevel programming
- On solving simple bilevel programs with a nonconvex lower level program
- New necessary optimality conditions in optimistic bilevel programming
- Solution algorithm for an optimistic linear Stackelberg problem
- Large-scale unit commitment under uncertainty: an updated literature survey
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Single-level reformulations of a specific non-smooth bilevel programming problem and their applications
- A solution method for the static constrained Stackelberg problem via penalty method
- Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs
- Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs
- Some new optimality conditions for semivector bilevel optimization program
- Statistics with set-valued functions: applications to inverse approximate optimization
- Bilevel and multilevel programming: A bibliography review
- On bilevel programs with a convex lower-level problem violating Slater's constraint qualification
- A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming
- A solution method for the linear static Stackelberg problem using penalty functions
- Determination of Stackelberg-Nash equilibria using a sensitivity based approach
- Bilevel road pricing: theoretical analysis and optimality conditions
- Weak via strong Stackelberg problem: New results
- Solving inverse optimal control problems via value functions to global optimality
- Necessary optimality conditions for Stackelberg problems
- Numerically tractable optimistic bilevel problems
- Convexification method for bilevel programs with a nonconvex Follower's problem
- Shape optimisation with the level set method for contact problems in linearised elasticity
- Applying directional upper semi-regular convexificators in bilevel optimization
- Bilevel optimization and variational analysis
- Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping
- Generic property of the partial calmness condition for bilevel programming problems
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- On a three-level competitive pricing problem with uniform and mill pricing strategies
- A bridge between bilevel programs and Nash games
- Solving discrete linear bilevel optimization problems using the optimal value reformulation
- Optimality conditions for special semidefinite bilevel optimization problems
- On calmness conditions in convex bilevel programming
- A Lagrange multiplier expression method for bilevel polynomial optimization
- Constraint qualifications and optimality conditions in bilevel optimization
- Directional necessary optimality conditions for bilevel programs
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems
- Modeling and solving the benchmark case in a differentiated Stackelberg duopoly
- Title not available (Why is that?)
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- Bilevel polynomial programs and semidefinite relaxation methods
- A dynamic reformulation heuristic for generalized interdiction problems
- Bilevel programming approaches to production planning for multiple products with short life cycles
- Necessary optimality conditions for bilevel minimization problems
- Regularization and approximation methods in Stackelberg games and bilevel optimization
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
- Interactions between bilevel optimization and Nash games
- New necessary and sufficient optimality conditions for strong bilevel programming problems
- A nonsmooth Stackelberg equilibrium problem via mixed variational inequalities
- A theoretical approximation scheme for Stackelberg problems
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
- Optimizing power generation in the presence of micro-grids
Uses Software
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)
