Existence and approximation results involving regularized constrained Stackelberg problems
The authors study two-level optimization problems in the Stackelberg framework. They extend earlier results due to Loridan and Morgan by considering a more general case when the set of constraints in the upper level problem depends on the set of optimal solutions to the lower level problem. They use a regularization scheme proposed by the above-mentioned authors to obtain an approximation of the original problem. They obtain convergence of approximate marginal values without convexity and quasiconvexity assumptions.
- Sequential stability of regularized constrained stackelberg problems
- A theoretical approximation scheme for Stackelberg problems
- A sequential stability result for constrained Stackelberg problems
- Existence of solution of constrained interval optimization problems with regularity concept
- Optimality and complexity for constrained optimization problems with nonconvex regularization
- Regularization and approximation methods in Stackelberg games and bilevel optimization
- scientific article; zbMATH DE number 1306979
- On approximate stationary points of the regularized mathematical program with complementarity constraints
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- The regularized constraint aggregation method for a problem of semi-infinite optimization
- A theoretical approximation scheme for Stackelberg problems
- New necessary and sufficient optimality conditions for strong bilevel programming problems
- scientific article; zbMATH DE number 5504992 (Why is no real title available?)
- scientific article; zbMATH DE number 4006030 (Why is no real title available?)
- New results on approximate solution in two-level optimization
- Sequential stability of regularized constrained stackelberg problems
- scientific article; zbMATH DE number 770227 (Why is no real title available?)
- Regularization and approximation methods in Stackelberg games and bilevel optimization
- Bilevel optimization: theory, algorithms, applications and a bibliography
- An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
- A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function
- On the existence of solutions for weak nonlinear bilevel optimization problems
This page was built for publication: Existence and approximation results involving regularized constrained Stackelberg problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342472)
