On bilevel programming, Part I: General nonlinear cases
暂无分享,去创建一个
[1] G. R. Walsh,et al. Methods Of Optimization , 1976 .
[2] P. Wolfe. Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .
[3] R. Mifflin. Semismooth and Semiconvex Functions in Constrained Optimization , 1977 .
[4] W. Hager. Lipschitz Continuity for Constrained Processes , 1979 .
[5] Stephen M. Robinson,et al. Strongly Regular Generalized Equations , 1980, Math. Oper. Res..
[6] M. Kojima. Strongly Stable Stationary Solutions in Nonlinear Programs. , 1980 .
[7] E. Aiyoshi,et al. A new computational method for Stackelberg and min-max problems by use of a penalty method , 1981 .
[8] José Fortuny-Amat,et al. A Representation and Economic Interpretation of a Two-Level Programming Problem , 1981 .
[9] Jonathan F. Bard,et al. An explicit solution to the multi-level programming problem , 1982, Comput. Oper. Res..
[10] Wayne F. Bialas,et al. On two-level optimization , 1982 .
[11] S. M. Robinson. Local structure of feasible sets in nonlinear programming , 1983 .
[12] Jonathan F. Bard. An Algorithm for Solving the General Bilevel Programming Problem , 1983, Math. Oper. Res..
[13] K. Jittorntrum. Solution point differentiability without strict complementarity in nonlinear programming , 1984 .
[14] J. Bard. Optimality conditions for the bilevel programming problem , 1984 .
[15] K. Kiwiel. Methods of Descent for Nondifferentiable Optimization , 1985 .
[16] V. F. Dem'yanov,et al. Nondifferentiable Optimization , 1985 .
[17] S. M. Robinson. Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity , 1987 .
[18] R. Fletcher. Practical Methods of Optimization , 1988 .
[19] Garth P. McCormick,et al. Second-order sensitivity analysis in factorable programming: Theory and applications , 1988, Math. Program..
[20] R. Schnabel,et al. A view of unconstrained optimization , 1989 .
[21] C. Lemaréchal. Nondifferentiable optimization , 1989 .
[22] J. Pang. Solution differentiability and continuation of Newton's method for variational inequality problems over polyhedral sets , 1990 .
[23] L. Lasdon,et al. Derivative evaluation and computational experience with large bilevel mathematical programs , 1990 .
[24] Jonathan F. Bard,et al. Algorithms for nonlinear bilevel mathematical programs , 1991, IEEE Trans. Syst. Man Cybern..
[25] Eitaro Aiyoshi,et al. Double penalty method for bilevel optimization problems , 1992, Ann. Oper. Res..
[26] Terry L. Friesz,et al. Hierarchical optimization: An introduction , 1992, Ann. Oper. Res..
[27] Jochem Zowe,et al. A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..
[28] U. Felgenhauer. On the stable global convergence of particular quasi-newton-methods , 1992 .
[29] Stephen M. Robinson,et al. Normal Maps Induced by Linear Transformations , 1992, Math. Oper. Res..
[30] Garth P. McCormick,et al. Implicitly defined optimization problems , 1992, Ann. Oper. Res..
[31] Anthony V. Fiacco,et al. Degeneracy in NLP and the development of results motivated by its presence , 1993, Ann. Oper. Res..
[32] Liqun Qi,et al. Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations , 1993, Math. Oper. Res..
[33] Jiming Liu. Sensitivity Analysis in Nonlinear Programs and Variational Inequalities via Continuous Selections , 1995 .
[34] Jong-Shi Pang,et al. Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps , 1996, Math. Oper. Res..