论文信息 - New results on approximate solution in two-level optimization

New results on approximate solution in two-level optimization

This paper is a continuation of a recent work on two level optimization problems that we have submitted in [11]. We improve and extend approximation results that we obtained for a approximate solutions. By considering an e-regularized problem, together with convexity assumptions in the lower level, we get some new interesting properties and, in particular, an existence result for the solutions to the regularized problem.

J. Morgan | P. Loridan

[1] J. Cruz,et al. Additional aspects of the Stackelberg strategy in nonzero-sum games , 1973 .

[2] J. Cruz,et al. On the Stackelberg strategy in nonzero-sum games , 1973 .

[3] D. A. Molodtsov,et al. Approximation of two-person games with information exchange , 1973 .

[4] R. Wets,et al. APPROXIMATION AND CONVERGENCE IN NONLINEAR OPTIMIZATION , 1981 .

[5] E. Aiyoshi,et al. A new computational method for Stackelberg and min-max problems by use of a penalty method , 1981 .

[6] T. Başar,et al. Dynamic Noncooperative Game Theory , 1982 .

[7] Jonathan F. Bard,et al. An explicit solution to the multi-level programming problem , 1982, Comput. Oper. Res..

[8] H. Attouch. Variational convergence for functions and operators , 1984 .

[9] T. Zolezzi. On stability analysis in mathematical programming , 1984 .

[10] Jacqueline Morgan,et al. Approximation of the stackelberg problem and applications in control theory , 1985 .

[11] S. Dolecki. Convergence of minima in convergence spaces 1 , 1986 .

[12] Jacqueline Morgan,et al. Approximate solutions for two-level optimization problems , 1988 .

[13] Jonathan F. BARD,et al. Convex two-level optimization , 1988, Math. Program..

[14] J. Morgan,et al. A theoretical approximation scheme for Stackelberg problems , 1989 .