{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:18:12Z","timestamp":1767982692294,"version":"3.49.0"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T00:00:00Z","timestamp":1569542400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T00:00:00Z","timestamp":1569542400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-15-1-0237"],"award-info":[{"award-number":["FA9550-15-1-0237"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["DMS-1208338"],"award-info":[{"award-number":["DMS-1208338"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006221","name":"United States - Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2014241"],"award-info":[{"award-number":["2014241"]}],"id":[{"id":"10.13039\/100006221","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s10107-019-01432-w","type":"journal-article","created":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T07:03:28Z","timestamp":1569567808000},"page":"357-383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria"],"prefix":"10.1007","volume":"185","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5245-0458","authenticated-orcid":false,"given":"D.","family":"Drusvyatskiy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. D.","family":"Ioffe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. S.","family":"Lewis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,27]]},"reference":[{"issue":"2","key":"1432_CR1","first-page":"365","volume":"15","author":"FJ Arag\u00f3n\u00a0Artacho","year":"2008","unstructured":"Arag\u00f3n\u00a0Artacho, F.J., Geoffroy, M.H.: Characterization of metric regularity of subdifferentials. J. Convex Anal. 15(2), 365\u2013380 (2008)","journal-title":"J. Convex Anal."},{"issue":"1\u20132, Ser. A","key":"1432_CR2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward\u2013backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137(1\u20132, Ser. A), 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"1432_CR3","unstructured":"Bai, Y., Duchi, J., Mei, S.: Proximal algorithms for constrained composite optimization, with applications to solving low-rank SDPs (2019). Preprint arXiv:1903.00184"},{"issue":"1","key":"1432_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage\u2013thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"1432_CR5","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.S., Shiota, M.: Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2), 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"1432_CR6","doi-asserted-by":"crossref","first-page":"3319","DOI":"10.1090\/S0002-9947-09-05048-X","volume":"362","author":"J Bolte","year":"2010","unstructured":"Bolte, J., Daniilidis, A., Ley, O., Mazet, L.: Characterizations of \u0142ojasiewicz inequalities: subgradient flows, talweg, convexity. Trans. Am. Math. Soc. 362(6), 3319\u20133363 (2010)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"1432_CR7","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10107-016-1091-6","volume":"165","author":"J Bolte","year":"2017","unstructured":"Bolte, J., Nguyen, T.P., Peypouquet, J., Suter, B.: From error bounds to the complexity of first-order descent methods for convex functions. Math. Program. 165(2), 471\u2013507 (2017)","journal-title":"Math. Program."},{"issue":"1\u20132, Ser. A","key":"1432_CR8","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1\u20132, Ser. A), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"3","key":"1432_CR9","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/BF01584377","volume":"33","author":"JV Burke","year":"1985","unstructured":"Burke, J.V.: Descent methods for composite nondifferentiable optimization problems. Math. Program. 33(3), 260\u2013279 (1985)","journal-title":"Math. Program."},{"issue":"2","key":"1432_CR10","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01585997","volume":"71","author":"JV Burke","year":"1995","unstructured":"Burke, J.V., Ferris, M.C.: A Gauss\u2013Newton method for convex composite optimization. Math. Program. 71(2), 179\u2013194 (1995)","journal-title":"Math. Program."},{"issue":"3","key":"1432_CR11","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/030601296","volume":"15","author":"JV Burke","year":"2005","unstructured":"Burke, J.V., Lewis, A.S., Overton, M.L.: A robust gradient sampling algorithm for nonsmooth, nonconvex optimization. SIAM J. Optim. 15(3), 751\u2013779 (2005)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1432_CR12","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10107-015-0941-y","volume":"157","author":"RH Byrd","year":"2016","unstructured":"Byrd, R.H., Nocedal, J., Oztoprak, F.: An inexact successive quadratic approximation method for l-1 regularized optimization. Math. Program. 157(2), 375\u2013396 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"1432_CR13","doi-asserted-by":"crossref","first-page":"1721","DOI":"10.1137\/11082381X","volume":"21","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming. SIAM J. Optim. 21(4), 1721\u20131739 (2011)","journal-title":"SIAM J. Optim."},{"key":"1432_CR14","unstructured":"Charisopoulos, V., Davis, D., D\u00edaz, M., Drusvyatskiy, D.: Composite optimization for robust blind deconvolution (2019). arXiv preprint arXiv:1901.01624"},{"key":"1432_CR15","volume-title":"Nonsmooth Analysis and Control Theory. Texts in Mathematics","author":"FH Clarke","year":"1998","unstructured":"Clarke, F.H., Ledyaev, Y., Stern, R.I., Wolenski, P.R.: Nonsmooth Analysis and Control Theory. Texts in Mathematics, vol. 178. Springer, New York (1998)"},{"issue":"1","key":"1432_CR16","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29(1), 207\u2013239 (2019)","journal-title":"SIAM J. Optim."},{"key":"1432_CR17","first-page":"180","volume":"68","author":"E De\u00a0Giorgi","year":"1980","unstructured":"De\u00a0Giorgi, E., Marino, A., Tosques, M.: Problemi di evoluzione in spazi metrici e curve di massima pendenza. Atti Acad. Nat. Lincei Rend. Cl. Sci. Fiz. Mat. Natur. 68, 180\u2013187 (1980)","journal-title":"Atti Acad. Nat. Lincei Rend. Cl. Sci. Fiz. Mat. Natur."},{"key":"1432_CR18","unstructured":"Drusvyatskiy, D.: Slope and geometry in variational mathematics. PhD thesis, Cornell University (2013)"},{"issue":"2, Ser. A","key":"1432_CR19","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/s10107-014-0820-y","volume":"153","author":"D Drusvyatskiy","year":"2015","unstructured":"Drusvyatskiy, D., Ioffe, A.D.: Quadratic growth and critical point stability of semi-algebraic functions. Math. Program. 153(2, Ser. A), 635\u2013653 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"1432_CR20","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1137\/130920216","volume":"53","author":"D Drusvyatskiy","year":"2015","unstructured":"Drusvyatskiy, D., Ioffe, A.D., Lewis, A.S.: Curves of descent. SIAM J. Control Optim. 53(1), 114\u2013138 (2015)","journal-title":"SIAM J. Control Optim."},{"issue":"6","key":"1432_CR21","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1007\/s10208-015-9279-3","volume":"15","author":"D Drusvyatskiy","year":"2015","unstructured":"Drusvyatskiy, D., Ioffe, A.D., Lewis, A.S.: Transversality and alternating projections for nonconvex sets. Found. Comput. Math. 15(6), 1637\u20131651 (2015)","journal-title":"Found. Comput. Math."},{"key":"1432_CR22","unstructured":"Drusvyatskiy, D., Ioffe, A.D., Lewis, A.S.: Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria (2016). arXiv:1610.03446 (Ver. 1)"},{"issue":"3","key":"1432_CR23","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1287\/moor.2017.0889","volume":"43","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Error bounds, quadratic growth, and linear convergence of proximal methods. Math. Oper. Res. 43(3), 919\u2013948 (2018)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1432_CR24","first-page":"1165","volume":"21","author":"D Drusvyatskiy","year":"2014","unstructured":"Drusvyatskiy, D., Mordukhovich, B.S., Nghia, T.T.A.: Second-order growth, tilt stability, and metric regularity of the subdifferential. J. Convex Anal. 21(4), 1165\u20131192 (2014)","journal-title":"J. Convex Anal."},{"key":"1432_CR25","doi-asserted-by":"publisher","unstructured":"Drusvyatskiy, D., Paquette, C.: Efficiency of minimizing compositions of convex functions and smooth maps. Math. Prog. (2016). https:\/\/doi.org\/10.1007\/s1010, arXiv:1605.00125","DOI":"10.1007\/s1010"},{"issue":"3","key":"1432_CR26","first-page":"471","volume":"8","author":"JC Duchi","year":"2018","unstructured":"Duchi, J.C., Ruan, F.: Solving (most) of a set of quadratic equalities: Composite optimization for robust phase retrieval. Inf. Infer. J. IMA 8(3), 471\u2013529 (2018)","journal-title":"Inf. Infer. J. IMA"},{"key":"1432_CR27","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/0022-247X(74)90025-0","volume":"47","author":"I Ekeland","year":"1974","unstructured":"Ekeland, I.: On the variational principle. J. Math. Anal. Appl. 47, 324\u2013353 (1974)","journal-title":"J. Math. Anal. Appl."},{"key":"1432_CR28","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BFb0120959","volume-title":"Nondifferential and Variational Techniques in Optimization (Lexington, Ky., 1980). Mathematical Programming Studies","author":"R Fletcher","year":"1982","unstructured":"Fletcher, R.: A model algorithm for composite nondifferentiable optimization problems. In: Sorensen, D.C., Wets, R.J.B. (eds.) Nondifferential and Variational Techniques in Optimization (Lexington, Ky., 1980). Mathematical Programming Studies, vol. 17, pp. 67\u201376. Springer, Berlin (1982)"},{"key":"1432_CR29","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BFb0120959","volume-title":"Nondifferential and Variational Techniques in Optimization","author":"R Fletcher","year":"1982","unstructured":"Fletcher, R.: A model algorithm for composite nondifferentiable optimization problems. In: Sorensen, D.C., Wets, R.J.B. (eds.) Nondifferential and Variational Techniques in Optimization, pp. 67\u201376. Springer, Berlin (1982)"},{"issue":"4","key":"1432_CR30","doi-asserted-by":"crossref","first-page":"2494","DOI":"10.1137\/18M1171989","volume":"11","author":"J Geiping","year":"2018","unstructured":"Geiping, J., Moeller, M.: Composite optimization by nonconvex majorization\u2013minimization. SIAM J. Imaging Sci. 11(4), 2494\u20132528 (2018)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1\u20132, Ser. A","key":"1432_CR31","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156(1\u20132, Ser. A), 59\u201399 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"1432_CR32","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01584320","volume":"13","author":"AA Goldstein","year":"1977","unstructured":"Goldstein, A.A.: Optimization of Lipschitz continuous functions. Math. Program. 13(1), 14\u201322 (1977)","journal-title":"Math. Program."},{"issue":"3(333)","key":"1432_CR33","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4213\/rm292","volume":"55","author":"AD Ioffe","year":"2000","unstructured":"Ioffe, A.D.: Metric regularity and subdifferential calculus. Uspekhi Mat. Nauk 55(3(333)), 103\u2013162 (2000)","journal-title":"Uspekhi Mat. Nauk"},{"key":"1432_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-64277-2","volume-title":"Variational Analysis of Regular Mappings. Springer Monographs in Mathematics","author":"AD Ioffe","year":"2017","unstructured":"Ioffe, A.D.: Variational Analysis of Regular Mappings. Springer Monographs in Mathematics. Springer, Berlin (2017)"},{"key":"1432_CR35","unstructured":"Jin, C., Netrapalli, P., Jordan, M.I.: Minmax optimization: stable limit points of gradient descent ascent are locally optimal (2019). arXiv preprint arXiv:1902.00618"},{"key":"1432_CR36","series-title":"Nonconvex Optimization and Its Applications","volume-title":"Nonsmooth Equations in Optimization: Regularity, Calculus, Methods and Applications","author":"D Klatte","year":"2002","unstructured":"Klatte, D., Kummer, B.: Nonsmooth Equations in Optimization: Regularity, Calculus, Methods and Applications. Nonconvex Optimization and Its Applications, vol. 60. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"3","key":"1432_CR37","doi-asserted-by":"crossref","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Ann. Inst. Fourier (Grenoble) 48(3), 769\u2013783 (1998)","journal-title":"Ann. Inst. Fourier (Grenoble)"},{"key":"1432_CR38","first-page":"1","volume":"158","author":"AS Lewis","year":"2015","unstructured":"Lewis, A.S., Wright, S.J.: A proximal method for composite minimization. Math. Program. 158, 1\u201346 (2015)","journal-title":"Math. Program."},{"issue":"1\u20134","key":"1432_CR39","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46\/47","author":"Z-Q Luo","year":"1993","unstructured":"Luo, Z.-Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46\/47(1\u20134), 157\u2013178 (1993). Degeneracy in optimization problems","journal-title":"Ann. Oper. Res."},{"issue":"Ser. R\u20133","key":"1432_CR40","first-page":"154","volume":"4","author":"B Martinet","year":"1970","unstructured":"Martinet, B.: R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives. Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle 4(Ser. R\u20133), 154\u2013158 (1970)","journal-title":"Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle"},{"key":"1432_CR41","first-page":"A163","volume":"274","author":"B Martinet","year":"1972","unstructured":"Martinet, B.: D\u00e9termination approch\u00e9e d\u2019un point fixe d\u2019une application pseudo-contractante. Cas de l\u2019application prox. C. R. Acad. Sci. Paris S\u00e9r. A-B 274, A163\u2013A165 (1972)","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. A-B"},{"issue":"1, Ser. A","key":"1432_CR42","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton method and its global performance. Math. Program. 108(1, Ser. A), 177\u2013205 (2006)","journal-title":"Math. Program."},{"issue":"3","key":"1432_CR43","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for solving the convex programming problem with convergence rate $$O(1\/k^{2})$$. Dokl. Akad. Nauk SSSR 269(3), 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"3","key":"1432_CR44","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1080\/08927020600643812","volume":"22","author":"Y Nesterov","year":"2007","unstructured":"Nesterov, Y.: Modified Gauss\u2013Newton scheme with worst case guarantees for global performance. Optim. Methods Softw. 22(3), 469\u2013483 (2007)","journal-title":"Optim. Methods Softw."},{"issue":"1, Ser. B","key":"1432_CR45","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10107-006-0089-x","volume":"112","author":"Y Nesterov","year":"2008","unstructured":"Nesterov, Y.: Accelerating the cubic regularization of Newton\u2019s method on convex problems. Math. Program. 112(1, Ser. B), 159\u2013181 (2008)","journal-title":"Math. Program."},{"issue":"1, Ser. B","key":"1432_CR46","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1, Ser. B), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"1432_CR47","volume-title":"Numerical Optimization. Springer Series in Operations Research and Financial Engineering","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, New York (2006)","edition":"2"},{"issue":"3","key":"1432_CR48","first-page":"571","volume":"4","author":"D Noll","year":"2008","unstructured":"Noll, D., Prot, O., Rondepierre, A.: A proximity control algorithm to minimize nonsmooth and nonconvex functions. Pac. J. Optim. 4(3), 571\u2013604 (2008)","journal-title":"Pac. J. Optim."},{"key":"1432_CR49","first-page":"1","volume":"181","author":"P Ochs","year":"2017","unstructured":"Ochs, P., Fadili, J., Brox, T.: Non-smooth non-convex Bregman minimization: unification and new algorithms. J. Optim. Theory Appl. 181, 1\u201335 (2017)","journal-title":"J. Optim. Theory Appl."},{"key":"1432_CR50","doi-asserted-by":"crossref","first-page":"1805","DOI":"10.1090\/S0002-9947-96-01544-9","volume":"348","author":"RA Poliquin","year":"1996","unstructured":"Poliquin, R.A., Rockafellar, R.T.: Prox-regular functions in variational analysis. Trans. Am. Math. Soc. 348, 1805\u20131838 (1996)","journal-title":"Trans. Am. Math. Soc."},{"issue":"4","key":"1432_CR51","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1016\/0041-5553(63)90382-3","volume":"3","author":"BT Polyak","year":"1963","unstructured":"Polyak, B.T.: Gradient methods for the minimisation of functionals. USSR Comput. Math. Math. Phys. 3(4), 864\u2013878 (1963)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1432_CR52","first-page":"187","volume-title":"Approximation Theory, IV (College Station, Tex., 1983)","author":"MJD Powell","year":"1983","unstructured":"Powell, M.J.D.: General algorithms for discrete nonlinear approximation calculations. In: Chui, C.K., Schumaker, L.L., Ward, J.D. (eds.) Approximation Theory, IV (College Station, Tex., 1983), pp. 187\u2013218. Academic Press, New York (1983)"},{"issue":"3","key":"1432_CR53","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF02591998","volume":"29","author":"MJD Powell","year":"1984","unstructured":"Powell, M.J.D.: On the global convergence of trust region algorithms for unconstrained minimization. Math. Program. 29(3), 297\u2013303 (1984)","journal-title":"Math. Program."},{"key":"1432_CR54","unstructured":"Rafique, H., Liu, M., Lin, Q., Yang, T.: Non-convex min\u2013max optimization: provable algorithms and applications in machine learning (2018). arXiv preprint arXiv:1810.02060"},{"issue":"5","key":"1432_CR55","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"1432_CR56","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1287\/moor.6.3.424","volume":"6","author":"RT Rockafellar","year":"1981","unstructured":"Rockafellar, R.T.: Proximal subgradients, marginal values, and augmented Lagrangians in nonconvex optimization. Math. Oper. Res. 6(3), 424\u2013436 (1981)","journal-title":"Math. Oper. Res."},{"key":"1432_CR57","volume-title":"Implicit Functions and Solution Mappings. Monographs in Mathematics","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Dontchev, A.L.: Implicit Functions and Solution Mappings. Monographs in Mathematics. Springer, Berlin (2009)"},{"key":"1432_CR58","first-page":"1","volume-title":"Practical Inexact Proximal Quasi-Newton Method with Global Complexity Analysis. Mathematical Programming","author":"K Scheinberg","year":"2016","unstructured":"Scheinberg, K., Tang, X.: Practical Inexact Proximal Quasi-Newton Method with Global Complexity Analysis. Mathematical Programming, pp. 1\u201335. Springer, Berlin (2016)"},{"key":"1432_CR59","volume-title":"Solving Derivative-Free Nonlinear Least Squares Problems with POUNDERS","author":"SM Wild","year":"2014","unstructured":"Wild, S.M.: Solving Derivative-Free Nonlinear Least Squares Problems with POUNDERS. Argonne National Lab, Lemont (2014)"},{"issue":"3","key":"1432_CR60","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1093\/imanum\/10.3.299","volume":"10","author":"SJ Wright","year":"1990","unstructured":"Wright, S.J.: Convergence of an inexact algorithm for composite nonsmooth optimization. IMA J. Numer. Anal. 10(3), 299\u2013321 (1990)","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"1432_CR61","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02591949","volume":"31","author":"Y Yuan","year":"1985","unstructured":"Yuan, Y.: On the superlinear convergence of a trust region algorithm for nonsmooth optimization. Math. Program. 31(3), 269\u2013285 (1985)","journal-title":"Math. Program."},{"issue":"2","key":"1432_CR62","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0362-546X(94)E0025-C","volume":"24","author":"R Zhang","year":"1995","unstructured":"Zhang, R., Treiman, J.: Upper-Lipschitz multifunctions and inverse subdifferentials. Nonlinear Anal. 24(2), 273\u2013286 (1995)","journal-title":"Nonlinear Anal."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01432-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01432-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01432-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T15:54:18Z","timestamp":1610985258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01432-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,27]]},"references-count":62,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["1432"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01432-w","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,27]]},"assertion":[{"value":"4 November 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}