Solving Bilevel Programs Based on Lower-Level Mond-Weir Duality

References

• Bard JF (1998) Practical Bilevel Optimization: Algorithms and Applications (Kluwer, Dordrecht, Germany).Crossref, Google Scholar
• Bracken J, McGill JT (1973) Mathematical programs with optimization problems in the constraints. Oper. Res. 21(1):37–44.Link, Google Scholar
• Byeon G, Van Hentenryck P (2022) Benders subproblem decomposition for bilevel problems with convex follower. INFORMS J. Comput. 34(3):1749–1767.Link, Google Scholar
• Caprara A, Carvalho M, Lodi A, Woeginger GJ (2016) Bilevel knapsack with interdiction constraints. INFORMS J. Comput. 28(2):319–333.Link, Google Scholar
• Clarke FH (1990) Optimization and Nonsmooth Analysis (SIAM, Philadelphia).Crossref, Google Scholar
• Colson B, Marcotte P, Savard G (2007) An overview of bilevel optimization. Ann. Oper. Res. 153:235–256.Crossref, Google Scholar
• Dempe S, Zemkoho AB (2013) The bilevel programming problem: Reformulations, constraint qualifications and optimality conditions. Math. Programming 138:447–473.Crossref, Google Scholar
• Egudo R, Mond B (1986) Duality with generalized convexity. J. Australian Math. Soc. 28(1):10–21.Crossref, Google Scholar
• Fukushima M, Luo ZQ, Pang JS (1998) A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints. Comput. Optim. Appl. 10:5–34.Crossref, Google Scholar
• Guo L, Lin GH, Ye JJ (2015) Solving mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 166:234–256.Crossref, Google Scholar
• Hansen P, Jaumard B, Savard G (1992) New branch-and-bound rules for linear bilevel programming. SIAM J. Sci. Statist. Comput. 13(5):1194–1217.Crossref, Google Scholar
• Hoheisel T, Kanzow C, Schwartz A (2013) Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints. Math. Programming 137:257–288.Crossref, Google Scholar
• Izmailov AF, Pogosyan A, Solodov MV (2012) Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints. Comput. Optim. Appl. 51(1):199–221.Crossref, Google Scholar
• Kleinert T, Schmidt M (2021) Computing feasible points of bilevel problems with a penalty alternating direction method. INFORMS J. Comput. 33(1):198–215.Link, Google Scholar
• Kunapuli G, Bennett KP, Hu J, Pang JS (2008) Classification model selection via bilevel programming. Optim. Methods Software 23(4):475–489.Crossref, Google Scholar
• Lachhwani K, Dwivedi A (2018) Bi-level and multi-level programming problems: Taxonomy of literature review and research issues. Arch. Comput. Methods Engrg. 25:847–877.Crossref, Google Scholar
• Li YW, Lin GH, Zhu X (2023) Github repository: Solving bilevel programs based on lower-level Mond-Weir duality. https://doi.org/10.1287/ijoc.2023.0108.cd, https://github.com/INFORMSJoC/2023.0108.Google Scholar
• Li YW, Lin GH, Zhang J, Zhu X (2022) A novel approach for bilevel programs based on Wolfe duality. Preprint, submitted February 14, https://arxiv.org/abs/2302.06838.Google Scholar
• Lin GH, Fukushima M (2006) Hybrid approach with active set identification for mathematical programs with complementarity constraints. J. Optim. Theory Appl. 128(1):1–28.Crossref, Google Scholar
• Lin GH, Chen X, Fukushima M (2009) Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization. Math. Programming 116:343–368.Crossref, Google Scholar
• Lin GH, Xu M, Ye JJ (2014) On solving simple bilevel programs with a nonconvex lower level program. Math. Programming 144:277–305.Crossref, Google Scholar
• Liu R, Liu X, Zeng S, Zhang J, Zhang Y (2023a) Hierarchical optimization-derived learning. IEEE Trans. Pattern Anal. Machine Intelligence 45(12):14693–14708.Google Scholar
• Liu R, Liu X, Zeng S, Zhang J, Zhang Y (2023b) Value-function-based sequential minimization for bi-level optimization. IEEE Trans. Pattern Anal. Machine Intelligence 45(12):15930–15948.Google Scholar
• Lu Z, Mei S (2023) First-order penalty methods for bilevel optimization. Preprint, submitted January 4, https://arxiv.org/abs/2301.01716.Google Scholar
• Luo ZQ, Pang JS, Ralph D (1996) Mathematical Programs with Equilibrium Constraints (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Ma X, Yao W, Ye JJ, Zhang J (2021) Combined approach with second-order optimality conditions for bilevel programming problems. Preprint, submitted July 31, https://arxiv.org/abs/2108.00179.Google Scholar
• Mond B, Weir T (1981) Generalized concavity and duality. Generalized Concavity in Optimization and Economics (Academic Press, San Diego).Google Scholar
• Scholtes S (2001) Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optim. 11(4):918–936.Crossref, Google Scholar
• Stackelberg HV (1952) Theory of the Market Economy (Oxford University Press, Oxford, UK).Google Scholar
• Xu M, Ye JJ (2014) A smoothing augmented Lagrangian method for solving simple bilevel programs. Comput. Optim. Appl. 59:353–377.Crossref, Google Scholar
• Ye JJ, Zhu D (1995) Optimality conditions for bilevel programming problems. Optimization 33(1):9–27.Crossref, Google Scholar
• Ye JJ, Zhu D (2010) New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches. SIAM J. Optim. 20(4):1885–1905.Crossref, Google Scholar
• Ye JJ, Yuan X, Zeng S, Zhang J (2023) Difference of convex algorithms for bilevel programs with applications in hyperparameter selection. Math. Programming 198(2):1583–1616.Crossref, Google Scholar
• Zeng B (2020) A practical scheme to compute the pessimistic bilevel optimization problem. INFORMS J. Comput. 32(4):1128–1142.Abstract, Google Scholar