Theoretical Smoothing Frameworks for Nonsmooth Simple Bilevel Problems

References

• [1] Alcantara JH, Nguyen CT, Okuno T, Takeda A, Chen JS (2025) Unified smoothing approach for best hyperparameter selection problem using a bilevel optimization strategy. Math. Programming 212(1):479–518.Crossref, Google Scholar
• [2] Beck A (2017) First-Order Methods in Optimization (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• [3] Bertsekas DP (1971) Control of uncertain systems with a set-membership description. PhD thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar
• [4] Chen X (2012) Smoothing methods for nonsmooth, nonconvex minimization. Math. Programming Ser. B 134(1):71–99.Crossref, Google Scholar
• [5] Chen C, Mangasarian OL (1995) A class of smoothing functions for nonlinear and mixed complementarity problems. Math. Programming 71:51–70.Crossref, Google Scholar
• [6] Chen X, Womersley RS, Ye JJ (2011) Minimizing the condition number of a gram matrix. SIAM J. Optim. 21(1):127–148.Crossref, Google Scholar
• [7] Clarke FH (1983) Optimization and Nonsmooth Analysis (Wiley-Interscience, New York).Google Scholar
• [8] Clarke FH, Ledyaev YS, Stern RJ, Wolenski PR (1998) Nonsmooth Analysis and Control Theory (Springer, New York).Google Scholar
• [9] Danskin JM (1967) The Theory of Max-Min and Its Applications to Weapons Allocation Problems (Springer, New York).Crossref, Google Scholar
• [10] Dempe S, Zemkoho A (2020) Bilevel Optimization: Advances and Next Challenges, Springer Optimization and Its Applications, vol. 161 (Springer, Cham, Switzerland).Crossref, Google Scholar
• [11] Dempe S, Kalashnikov V, Pérez-Valdés GA, Kalashnykova N (2015) Bilevel Programming Problems: Theory, Algorithms and Applications to Energy Networks, Energy Systems (Springer, Berlin, Heidelberg).Crossref, Google Scholar
• [12] Facchinei F, Pang JS (2003) Finite-Dimensional Variational Inequalities and Complementarity Problems (Springer-Verlag, New York).Google Scholar
• [13] Fang SC, Wu SY (1996) Solving min-max problems and linear semi-infinite programs. Comput. Math. Appl. 32(6):87–93.Crossref, Google Scholar
• [14] Franceschi L, Frasconi P, Salzo S, Grazzi R, Pontil M (2018) Bilevel programming for hyperparameter optimization and meta-learning. Dy J, Krause A, eds. Proc. 35th Internat. Conf. Machine Learn., vol. 80 (PMLR, New York), 1568–1577.Google Scholar
• [15] Ghadimi S, Wang M (2018) Approximation methods for bilevel programming. Preprint, submitted February 6, https://arxiv.org/abs/1802.02246.Google Scholar
• [16] Ji K, Yang J, Liang Y (2021) Bilevel optimization: Convergence analysis and enhanced design. Meila M, Zhang T, eds. Proc. 38th Internat. Conf. Machine Learn., vol. 139 (PMLR, New York), 4882–4892.Google Scholar
• [17] Lampariello L, Sagratella S (2020) Numerically tractable optimistic bilevel problems. Comput. Optim. Appl. 76(2):277–303.Crossref, Google Scholar
• [18] Li XS, Fang SC (1997) On the entropic regularization method for solving min-max problems with applications. Math. Methods Oper. Res. 46(1):119–130.Crossref, Google Scholar
• [19] Lin GH, Xu M, Ye JJ (2014) On solving simple bilevel programs with a nonconvex lower level program. Math. Programming Ser. A 144(1–2):277–305.Crossref, Google Scholar
• [20] Liu T, Pong TK, Takeda A (2019) A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems. Math. Programming Ser. B 176:339–367.Crossref, Google Scholar
• [21] Liu R, Liu X, Zeng S, Zhang J, Zhang Y (2023) Value-function-based sequential minimization for bi-level optimization. IEEE Trans. Pattern Anal. Machine Intelligence 45(12):15930–15948.Crossref, Google Scholar
• [22] Lu S (2023) SLM: A smoothed first-order Lagrangian method for structured constrained nonconvex optimization. Adv. Neural Inform. Processing Systems 36:80414–80454.Crossref, Google Scholar
• [23] Mirrlees J (1999) The theory of moral hazard and unobservable behaviour: Part I. Rev. Econom. Stud. 66(1):3–21.Crossref, Google Scholar
• [24] Okuno T, Takeda A, Kawana A, Watanabe M (2021) On ℓp-hyperparameter learning via bilevel nonsmooth optimization. J. Machine Learn. Res. 22(245):1–47.Google Scholar
• [25] Outrata J (1990) On the numerical solution of a class of Stackelberg problems. Zeitschrift Für Oper. Res. 34:255–277.Google Scholar
• [26] Pedregosa F (2016) Hyperparameter optimization with approximate gradient. Balcan MF, Weinberger KQ, eds. Proc. 33rd Internat. Conf. Machine Learn. (PMLR, New York), 737–746.Google Scholar
• [27] Rockafellar RT, Wets RJB (1998) Variational Analysis, Grundlehren der Mathematischen Wissenschaften, vol. 317 (Springer, Berlin, Heidelberg).Crossref, Google Scholar
• [28] Rudin W (1991) Functional Analysis, International Series in Pure and Applied Mathematics (McGraw-Hill, New York).Google Scholar
• [29] von Stackelberg H (2010) Market Structure and Equilibrium (Springer, Berlin, Heidelberg).Google Scholar
• [30] Xu M, Dai YH, Liu XW, Wang B (2024) Enhanced barrier-smoothing technique for bilevel optimization with nonsmooth mappings. Preprint, submitted August 19, https://arxiv.org/abs/2408.09661.Google Scholar
• [31] Ye JJ, Zhu D (1995) Optimality conditions for bilevel programming problems. Optim. 33(1):9–27.Crossref, Google Scholar
• [32] 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