Convergences of marginal functions with dependent constraints
From MaRDI portal
Publication:4327887
DOI10.1080/02331939208843758zbMath0814.49010OpenAlexW1980654449MaRDI QIDQ4327887
M. Beatrice Lignola, Jacqueline Morgan
Publication date: 11 June 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939208843758
Set-valued maps in general topology (54C60) Methods involving semicontinuity and convergence; relaxation (49J45)
Related Items
On bilevel programs with a convex lower-level problem violating Slater's constraint qualification ⋮ Generalized quasi-variational inequalities: duality under perturbations ⋮ Stability of regularized bilevel programming problems ⋮ Sequential stability of regularized constrained stackelberg problems ⋮ Variational preferences and equilibria in games under ambiguous belief correspondences ⋮ Weak stackelberg problem and mixed solutions under data perturbations11this paper is based upon a communication presented at the 14th symposium on mathematical programming with data perturbation, Washington D.C. 1992. This research has been supported by M.U.R.S.T Roma, Italia.$ef: ⋮ A limit theorem for equilibria under ambiguous belief correspondences ⋮ Variational convergence of bivariate functions: Lopsided convergence ⋮ Existence of solutions to two-level optimization problems with nonunique lower-level solutions ⋮ Weak via strong Stackelberg problem: New results ⋮ Mixed solutions for weak Stackelberg problems: existence and stability results. ⋮ Psychological Nash equilibria under ambiguity ⋮ An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems
Cites Work
- Decomposition of semifilters and sequential \(\Gamma\)-limits in completely distributive lattices
- Dynamic noncooperative game theory
- Optimization and nonsmooth analysis
- semi-continuities of marginal functions in a sequential setting
- New results on approximate solution in two-level optimization
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
