Two Typical Implementable Semismooth* Newton Methods for Generalized Equations Are G-Semismooth Newton Methods

References

• [1] Aragón Artacho FJ, Mordukhovich BS, Pérez Aros P (2024) Coderivative-based semi-Newton method in nonsmooth difference programming. Math. Programming, ePub ahead of print October 15, https://doi.org/10.1007/s10107-024-02142-8.Crossref, Google Scholar
• [2] Aragón Artacho FJ, Belyakov A, Dontchev AL, Lopez M (2014) Local convergence of quasi-Newton methods under metric regularity. Comput. Optim. Appl. 58(1):225–247.Crossref, Google Scholar
• [3] Aragón Artacho FJ, Dontchev AL, Gaydu M, Geoffroy MH, Veliov VM (2011) Metric regularity of Newton’s iteration. SIAM J. Control Optim. 49(2):339–362.Crossref, Google Scholar
• [4] Azé D, Chou CC (1995) On a Newton type iterative method for solving inclusions. Math. Oper. Res. 20(4):790–800.Link, Google Scholar
• [5] Bonnans JF (1994) Local analysis of Newton-type methods for variational inequalities and nonlinear programming. Appl. Math. Optim. 29:161–186.Crossref, Google Scholar
• [6] Bonnans JF, Shapiro A (2000) Perturbation Analysis of Optimization Problems (Springer, New York).Crossref, Google Scholar
• [7] Cibulka R, Dontchev AL, Geoffroy MH (2011) Inexact Newton methods and Dennis–Moré theorems for nonsmooth generalized equations. SIAM J. Control Optim. 49(2):339–362.Google Scholar
• [8] de Oliveira F, Ferreira O, Silva G (2019) Newton’s method with feasible inexact projections for solving constrained generalized equations. Comput. Optim. Appl. 72:159–177.Crossref, Google Scholar
• [9] Dias JM, Smirnov G (2012) On the Newton method for set-valued maps. Nonlinear Anal. 75:1219–1230.Crossref, Google Scholar
• [10] Dontchev AL (1996) Local analysis of a Newton-type method based on partial linearization. Renegar J, Shub M, Smale S, eds. The Mathematics of Numerical Analysis (AMS, Providence, RI), 295–306.Google Scholar
• [11] Dontchev AL (1996) Local convergence of the Newton method for generalized equations. Comptes Rendus de L’Académie Des Sci. Ser. I Math. 322(4):327–331.Google Scholar
• [12] Dontchev AL, Rockafellar RT (2010) Newton’s method for generalized equations: A sequential implicit function theorem. Math. Programming 123(1):139–159.Crossref, Google Scholar
• [13] Ferreira OP (2015) A robust semi-local convergence analysis of Newton’s method for cone inclusion problems in Banach spaces under affine invariant majorant condition. J. Comput. Appl. Math. 279:318–335.Crossref, Google Scholar
• [14] Ferreira OP, Silva GN (2017) Kantorovich’s theorem on Newton’s method for solving strongly regular generalized equation. SIAM J. Optim. 27(2):910–926.Crossref, Google Scholar
• [15] Ferreira OP, Silva GN (2018) Local convergence analysis of Newton’s method for solving strongly regular generalized equations. J. Math. Anal. Appl. 458(1):481–496.Crossref, Google Scholar
• [16] Fischer A (1999) Modified Wilson’s method for nonlinear programs with nonunique multipliers. Math. Oper. Res. 24(3):699–727.Link, Google Scholar
• [17] Gao Y, Sun DF (2009) Calibrating least squares semidefinite programming with equality and inequality constraints. SIAM J. Matrix Anal. Appl. 31(3):1432–1457.Crossref, Google Scholar
• [18] Gaydu M, Geoffroy MH (2013) A Newton iteration for differentiable set-valued maps. J. Math. Anal. Appl. 399(1):213–224.Crossref, Google Scholar
• [19] Geoffroy MH, Piétrus A (2004) Local convergence of some iterative methods for generalized equations. J. Math. Anal. Appl. 290(2):497–505.Crossref, Google Scholar
• [20] Geoffroy MH, Piétrus A (2005) A general iterative procedure for solving nonsmooth generalized equations. Comput. Optim. Appl. 31(1):57–67.Crossref, Google Scholar
• [21] Gfrerer H (2025) On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization. Comput. Optim. Appl. 91:67–124.Crossref, Google Scholar
• [22] Gfrerer H, Mordukhovich BS (2019) Second-order variational analysis of parametric constraint and variational systems. SIAM J. Optim. 29(1):423–453.Crossref, Google Scholar
• [23] Gfrerer H, Outrata JV (2021) On a semismooth* Newton method for solving generalized equations. SIAM J. Optim. 31(1):489–517.Crossref, Google Scholar
• [24] Gfrerer H, Outrata JV (2022) On (local) analysis of multifunctions via subspaces contained in graphs of generalized derivatives. J. Math. Anal. Appl. 508(2):125895.Crossref, Google Scholar
• [25] Gfrerer H, Outrata JV, Valdman J (2022) On the application of the SCD semismooth* Newton method to variational inequalities of the second kind. Set-Valued Variational Anal. 30:1453–1484.Crossref, Google Scholar
• [26] Gfrerer H, Mandlmayr M, Outrata JV, Valdman J (2023) On the SCD semismooth* Newton method for generalized equations with application to a class of static contact problems with Coulomb friction. Comput. Optim. Appl. 86:1159–1191.Crossref, Google Scholar
• [27] Gowda MS (2004) Inverse and implicit function theorems for H-differentiable and semismooth functions. Optim. Methods Software 19:443–461.Crossref, Google Scholar
• [28] Henrion R, Outrata JV (2001) A subdifferential condition for calmness of multifunctions. J. Math. Anal. Appl. 258:110–130.Crossref, Google Scholar
• [29] Hoheisel T, Kanzow C, Mordukhovich BS, Phan H (2012) Generalized Newton’s method based on graphical derivatives. Nonlinear Anal. 75(3):1324–1340.Crossref, Google Scholar
• [30] Hoheisel T, Kanzow C, Mordukhovich BS, Phan H (2013) Erratum to “Generalized Newton’s method based on graphical derivatives” [Nonlinear Anal. TMA 75 (2012) 1324–1340]. Nonlinear Anal. Theory Methods Appl. 86:157–158.Crossref, Google Scholar
• [31] Izmailov A, Solodov M (2010) Inexact Josephy–Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization. Comput. Optim. Appl. 46(2):347–368.Crossref, Google Scholar
• [32] Izmailov A, Solodov M (2014) Newton-Type Methods for Optimization and Variational Problems (Springer, New York).Crossref, Google Scholar
• [33] Izmailov A, Solodov M (2015) Newton-type methods: A broader view. J. Optim. Theory Appl. 164:577–620.Crossref, Google Scholar
• [34] Josephy N (1979) Newton’s method for generalized equations and the PIES energy model. PhD dissertation, University of Wisconsin–Madison, Madison.Google Scholar
• [35] Josephy N (1979) Quasi-Newton method for generalized equations. Technical report, University Wisconsin–Madison, Madison.Google Scholar
• [36] Khanh PD, Mordukhovich BS, Phat VT (2023) A generalized Newton method for subgradient systems. Math. Oper. Res. 48(4):1811–1845.Link, Google Scholar
• [37] Khanh PD, Mordukhovich BS, Phat VT (2025) Coderivative-based Newton methods in structured nonconvex and nonsmooth optimization. Preprint, submitted May 21, https://arxiv.org/abs/2403.04262.Google Scholar
• [38] Khanh PD, Mordukhovich BS, Phat VT, Tran DB (2023) Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials. J. Global Optim. 86(1):93–122.Crossref, Google Scholar
• [39] Khanh PD, Mordukhovich BS, Phat VT, Tran DB (2024) Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization. Math. Programming 205(1):373–429.Crossref, Google Scholar
• [40] Klatte D, Kummer B (2002) Nonsmooth Equations in Optimization (Kluwer Academic Publishers, New York).Google Scholar
• [41] Klatte D, Kummer B (2018) Approximation and generalized Newton methods. Math. Programming 168:673–716.Crossref, Google Scholar
• [42] Kummer B (1988) Newton’s method for non-differentiable functions. Guddat J, ed. Advances in Mathematical Optimization (De Gruyter, Berlin), 114–125.Crossref, Google Scholar
• [43] Kummer B (1992) Newton’s method based on generalized derivatives for nonsmooth functions: Convergence analysis. Oettli W, Pallaschke D, eds. Advances in Optimization (Springer, Berlin), 171–194.Crossref, Google Scholar
• [44] Kummer B (2000) Generalized Newton and NCP-methods: Convergence, regularity, actions. Discussiones Mathematicae Differential Inclusions Control Optim. 20(2):209–244.Crossref, Google Scholar
• [45] Li X, Sun DF, Toh K-C (2018) A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems. SIAM J. Optim. 28(1):433–458.Crossref, Google Scholar
• [46] Meng F, Sun DF, Zhao G (2005) Semismoothness of solutions to generalized equations and the Moreau–Yosida regularization. Math. Programming 104:561–581.Crossref, Google Scholar
• [47] Mifflin R (1977) Semismooth and semiconvex functions in constrained optimization. SIAM J. Control Optim. 15:957–972.Crossref, Google Scholar
• [48] Mordukhovich BS (2006) Variational Analysis and Generalized Differentiation I: Basic Theory (Springer, Berlin).Crossref, Google Scholar
• [49] Mordukhovich BS (2024) Second-Order Variational Analysis in Optimization, Variational Stability, and Control: Theory, Algorithms, Applications (Springer, Cham, Switzerland).Crossref, Google Scholar
• [50] Mordukhovich BS, Sarabi ME (2021) Generalized Newton algorithms for tilt-stable minimizers in nonsmooth optimization. SIAM J. Optim. 31(2):1184–1214.Crossref, Google Scholar
• [51] Pang J-S (1990) Newton’s method for B-differentiable equations. Math. Oper. Res. 15(2):311–341.Link, Google Scholar
• [52] Pang J-S, Sun DF, Sun J (2003) Semismooth homeomorphisms and strong stability of semidefinite and Lorentz complementarity problems. Math. Oper. Res. 28(1):39–63.Link, Google Scholar
• [53] Qi L, Sun J (1993) A nonsmooth version of Newton’s method. Math. Programming 58:353–367.Crossref, Google Scholar
• [54] Qi L, Sun DF, Zhou G (2000) A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities. Math. Programming 87:1–35.Crossref, Google Scholar
• [55] Rademacher H (1919) Über partielle und totale differenzierbarkeit von Funktionen mehrerer Variabeln und über die Transformation der Doppelintegrale. Mathematische Annalen 79:340–359.Crossref, Google Scholar
• [56] Robinson S (1994) Newton’s method for a class of nonsmooth functions. Set-Valued Anal. 2:291–305.Crossref, Google Scholar
• [57] Rockafellar RT (1970) Convex Analysis (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• [58] Rockafellar RT (1976) Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5):877–898.Crossref, Google Scholar
• [59] Rockafellar RT, Wets RJB (1998) Variational Analysis (Springer, Berlin).Crossref, Google Scholar
• [60] Shapiro A (2003) Sensitivity analysis of generalized equations. J. Math. Sci. 115:2554–2565.Crossref, Google Scholar
• [61] Solodov MV, Svaiter BF (2002) A new proximal-based globalization strategy for the Joseph–Newton method for variational inequalities. Optim. Methods Software 17(5):965–983.Crossref, Google Scholar
• [62] Sun DF (2006) The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications. Math. Oper. Res. 31(4):761–776.Link, Google Scholar
• [63] Yang L, Sun DF, Toh K-C (2015) SDPNAL+: A majorized semismooth Newton–CG augmented Lagrangian method for semidefinite programming with nonnegative constraints. Math. Programming Comput. 7(3):1–36.Crossref, Google Scholar
• [64] Zhao X, Sun DF, Toh K-C (2010) A Newton–CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20(4):1737–1765.Crossref, Google Scholar