Extended SQP Methods in Nonsmooth Difference Programming Applied to Problems with Variational Inequality Constraints

References

• [1] An LTV, Tao PD (2005) The DC (difference of convex functions) programming and DCA revisited with DC models of real-world nonconvex optimization problems. Ann. Oper. Res. 133(1):23–46.Crossref, Google Scholar
• [2] An LTH, Ngai HV, Tao PD (2014) DC programming and DCA for general DC programs. van Do T, Thi H, Nguyen N, eds. Adv. Comput. Methods Knowledge Engrg., Advances in Intelligent Systems and Computing, vol. 282 (Springer, Cham, Switzerland), 15–35.Google Scholar
• [3] Abdulaal M, LeBlanc LJ (1979) Continuous equilibrium network design models. Transportation Res. Part B: Methodological 13(1):19–32.Crossref, Google Scholar
• [4] Aragón-Artacho FJ, Vuong PT (2020) The boosted difference of convex functions algorithm for nonsmooth functions. SIAM J. Optim. 30(1):980–1006.Crossref, Google Scholar
• [5] Aragón-Artacho FJ, Mordukhovich BS, Pérez-Aros P (2025) Coderivative-based semi-Newton method in nonsmooth difference programming. Math. Programming 213(1–2):385–432.Crossref, Google Scholar
• [6] Attouch H, Bolté J, Svaiter BF (2013) Convergence of descent methods for semi-algebraic and tame problems: Proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel method. Math. Programming 137(1–2):91–129.Crossref, Google Scholar
• [7] Auslender A (2013) An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming. J. Optim. Theory Appl. 156(2):183–212.Crossref, Google Scholar
• [8] Beck A (2017) First-Order Methods in Optimization (SIAM, Philadelphia).Crossref, Google Scholar
• [9] Bento G, Mordukhovich BS, Mota T, Nesterov Y (2025) Convergence of descent optimization algorithms under Polyak–Łojasiewicz–Kurdyka conditions. J. Optim. Theory Appl. 207(3):41.Crossref, Google Scholar
• [10] Bertsekas DP (2016) Nonlinear Programming, 3rd ed. (Athena Scientific, Belmont, MA).Google Scholar
• [11] Boggs PT, Tolle JW (1995) Sequential quadratic programming. Acta Numer. 4:1–51.Crossref, Google Scholar
• [12] Bolté J, Daniilidis A, Lewis AS, Shiota M (2007) Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2):556–572.Crossref, Google Scholar
• [13] Clarke FH, Stern RJ, Wolenski PR (1995) Proximal smoothness and the lower-C2 property. J. Convex Anal. 2(1–2):117–144.Google Scholar
• [14] Dutta J, Lafhim L, Zemkoho A, Zhou S (2025) Nonconvex quasi-variational inequalities: Stability analysis and application to numerical optimization. J. Optim. Theory Appl. 204(2):16.Crossref, Google Scholar
• [15] Facchinei F, Pang JS (2003) Finite-Dimensional Variational Inequalities and Complementarity Problems (Springer, New York).Google Scholar
• [16] Ferreira OP, Mordukhovich BS, Santos WMS, Souza JCO (2026) An inexact boosted difference of convex algorithm for nondifferentiable functions. J. Optim. Theory Appl. 208(2):71.Crossref, Google Scholar
• [17] Fukushima M (1992) Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems. Math. Programming 53(1–3):99–110.Crossref, Google Scholar
• [18] Gidel G, Berard H, Vignoud G, Vincent P, Lacoste-Julien S (2019) A variational inequality perspective on generative adversarial networks. Proc. 7th Internat. Conf. Learn. Representations (OpenReview).Google Scholar
• [19] Guo L, Lin GH, Ye JJ (2015) Solving mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 166(1):234–256.Crossref, Google Scholar
• [20] Izmailov AF, Solodov MV (2014) Newton-Type Methods for Optimization and Variational Problems (Springer, Cham, Switzerland).Crossref, Google Scholar
• [21] Karimi H, Nutini J, Schmidt M (2016) Linear convergence of gradient and proximal-gradient methods under the Polyak-Łojasiewicz condition. Frasconi P, Landwehr N, Manco G, Vreeken J, eds. Machine Learn. Knowledge Discovery Databases. ECML PKDD 2016, Lecture Notes in Computer Science, vol. 9851 (Springer, Cham, Switzerland), 795–811.Google Scholar
• [22] Kinderlehrer D, Stampacchia G (2000) An Introduction to Variational Inequalities and Their Applications (SIAM, Philadelphia).Crossref, Google Scholar
• [23] Kočvara M, Outrata JV (1992) A nondifferentiable approach to the solution of optimum design problems with variational inequalities. Davisson LD, MacFarlane AGJ, Kwakernaak H, Massey JL, Tsypkin YZ, Viterbi AJ, Kall P, eds. System Model. Optim., Lecture Notes in Control and Information Sciences, vol. 180 (Springer, Berlin, Heidelberg), 364–373.Google Scholar
• [24] Lawrence C, Tits A (2001) A computationally efficient feasible sequential quadratic programming algorithm. SIAM J. Optim. 11(4):1092–1118.Crossref, Google Scholar
• [25] Liu R, Pan S, Wu Y, Yang X (2024) An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization. Comput. Optim. Appl. 88(2):603–641.Crossref, Google Scholar
• [26] Lucet Y, Ye JJ (2001) Sensitivity analysis of the value function for optimization problems with variational inequality constraints. SIAM J. Control Optim. 40(3):699–723.Crossref, Google Scholar
• [27] Marcotte P (1986) Network design problem with congestion effects: A case of bilevel programming. Math. Programming 34(2):142–162.Crossref, Google Scholar
• [28] Marcotte P, Zhu DL (1996) Exact and inexact penalty methods for the generalized bilevel programming problem. Math. Programming 74(2):141–157.Crossref, Google Scholar
• [29] Mordukhovich BS (2006) Variational Analysis and Generalized Differentiation, I: Basic Theory (Springer, Berlin, Heidelberg).Crossref, Google Scholar
• [30] Mordukhovich BS (2018) Variational Analysis and Applications (Springer, Cham, Switzerland).Crossref, Google Scholar
• [31] Mordukhovich BS, Nam NM (2022) Convex Analysis and Beyond. Volume I: Basic Theory (Springer, Cham, Switzerland).Crossref, Google Scholar
• [32] Mordukhovich BS, Nam NM (2023) An Easy Path to Convex Analysis and Applications, 2nd ed. (Springer, Cham, Switzerland).Crossref, Google Scholar
• [33] Nagurney A (1993) Network Economics: A Variational Inequality Approach (Kluwer Academic Publishers, Dordrecht, Netherlands).Crossref, Google Scholar
• [34] Nocedal J, Wright SJ (2006) Numerical Optimization, 2nd ed. (Springer, New York).Google Scholar
• [35] Outrata JV, Kočvara M, Zowe J (1998) Nonsmooth Approach to Optimization Problems with Equilibrium Constraints (Kluwer Academic Publishers, Dordrecht, Netherlands).Crossref, Google Scholar
• [36] Pang JS, Razaviyayn M, Alvarado A (2017) Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. 42(1):95–118.Link, Google Scholar
• [37] Rockafellar RT, Wets RJB (1998) Variational Analysis (Springer, Berlin).Crossref, Google Scholar
• [38] Samadi S, Yousefian F (2025) Improved guarantees for optimal Nash equilibrium seeking and bilevel variational inequalities. SIAM J. Optim. 35(1):369–399.Crossref, Google Scholar
• [39] 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
• [40] Steffensen S, Ulbrich M (2010) A new relaxation scheme for mathematical programs with equilibrium constraints. SIAM J. Optim. 20(5):2504–2539.Crossref, Google Scholar
• [41] Suwansirikul C, Friesz TL, Tobin RL (1987) Equilibrium decomposed optimization: A heuristic for the continuous equilibrium network design problem. Transportation Sci. 21(4):254–263.Link, Google Scholar
• [42] Tao PD, An LTH (1997) Convex analysis approach to DC programming: Theory, algorithms, and applications. Acta Math. Vietnamica 22(1):289–355.Google Scholar
• [43] Xu M, Ye JJ, Zhang L (2015) Smoothing SQP methods for solving degenerate nonsmooth constrained optimization problems with applications to bilevel programs. SIAM J. Optim. 25(3):1388–1410.Crossref, Google Scholar
• [44] Ye JJ (2000) Constraint qualifications and necessary optimality conditions for optimization problems with variational inequality constraints. SIAM J. Optim. 10(4):943–962.Crossref, Google Scholar
• [45] 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