On the numerical solution of a class of Stackelberg problems

From MaRDI portal

Publication:3200889

Jump to:navigation, search

DOI10.1007/BF01416737zbMath0714.90077OpenAlexW2028130620MaRDI QIDQ3200889

Jiří V. Outrata

Publication date: 1990

Published in: [https://portal.mardi4nfdi.de/entity/Q3199221 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

zbMATH Keywords

stability nonsmooth analysis set-valued maps nondifferentiable optimization optimum design elliptic variational inequality generalized Jacobians Stackelberg problem generalized gradients differentiability of marginal functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Hierarchical games (including Stackelberg games) (91A65) Variational inequalities (49J40) Nonsmooth analysis (49J52) Hierarchical systems (93A13) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Some new optimality conditions for semivector bilevel optimization program, On bilevel programs with a convex lower-level problem violating Slater's constraint qualification, Bilevel and multilevel programming: A bibliography review, Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments, Solution algorithm for an optimistic linear Stackelberg problem, Generic Property of the Partial Calmness Condition for Bilevel Programming Problems, Directional Necessary Optimality Conditions for Bilevel Programs, A bridge between bilevel programs and Nash games, Solving discrete linear bilevel optimization problems using the optimal value reformulation, First- and second-order optimality conditions in optimistic bilevel set-valued programming, Numerically tractable optimistic bilevel problems, Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems, Bilevel Polynomial Programs and Semidefinite Relaxation Methods, Focus programming: a bi‐level programming approach to static stochastic optimization problems, Bilevel programming approaches to production planning for multiple products with short life cycles, Applying directional upper semi-regular convexificators in bilevel optimization, Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods, Single-level reformulations of a specific non-smooth bilevel programming problem and their applications, Solving inverse optimal control problems via value functions to global optimality, Variational analysis of marginal functions with applications to bilevel programming, A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming, Estimates for coderivative of solution map in bilevel program, Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs, New necessary and sufficient optimality conditions for strong bilevel programming problems, Difference of convex algorithms for bilevel programs with applications in hyperparameter selection, The bilevel programming problem: reformulations, constraint qualifications and optimality conditions, Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies, Unnamed Item, On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem, Necessary optimality conditions for bilevel minimization problems, On solving simple bilevel programs with a nonconvex lower level program, Large-scale unit commitment under uncertainty: an updated literature survey, Is bilevel programming a special case of a mathematical program with complementarity constraints?, Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs, Statistics with set-valued functions: applications to inverse approximate optimization, On calmness conditions in convex bilevel programming, Optimality Conditions for Special Semidefinite Bilevel Optimization Problems, A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization, Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping, A dynamic reformulation heuristic for generalized interdiction problems, Necessary optimality conditions in pessimistic bilevel programming, Bilevel road pricing: theoretical analysis and optimality conditions, New necessary optimality conditions in optimistic bilevel programming, Optimizing power generation in the presence of micro-grids, Convexification method for bilevel programs with a nonconvex Follower's problem, A numerical approach to optimization problems with variational inequality constraints, A smoothing augmented Lagrangian method for solving simple bilevel programs, 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, Weak via strong Stackelberg problem: New results, Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs, 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, Necessary optimality conditions for Stackelberg problems

Uses Software

NLPQL

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3200889&oldid=16346130"