{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:02:00Z","timestamp":1762340520257},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,2,9]],"date-time":"2012-02-09T00:00:00Z","timestamp":1328745600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10589-012-9461-3","type":"journal-article","created":{"date-parts":[[2012,2,8]],"date-time":"2012-02-08T10:38:35Z","timestamp":1328697515000},"page":"755-769","source":"Crossref","is-referenced-by-count":16,"title":["Descentwise inexact proximal algorithms for smooth optimization"],"prefix":"10.1007","volume":"53","author":[{"given":"Marc","family":"Fuentes","sequence":"first","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Malick","sequence":"additional","affiliation":[]},{"given":"Claude","family":"Lemar\u00e9chal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,9]]},"reference":[{"key":"9461_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L. Armijo","year":"1966","unstructured":"Armijo, L.: Minimization of functions having Lipschitz continuous first partial derivatives. Pac. J. Math. 16, 1\u20133 (1966)","journal-title":"Pac. J. Math."},{"key":"9461_CR2","volume-title":"Numerical Inversion of the Laplace Transform","author":"R.E. Bellman","year":"1966","unstructured":"Bellman, R.E., Kalaba, R.E., Lockett, J.: Numerical Inversion of the Laplace Transform. Elsevier, New York (1966), pp.\u00a0143\u2013144"},{"issue":"1","key":"9461_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I. Bongartz","year":"1995","unstructured":"Bongartz, I., Conn, A.R., Gould, N., Toint, Ph.L.: CUTE: Constrained and Unconstrained Testing Environment. ACM Trans. Math. Softw. 21(1), 123\u2013260 (1995)","journal-title":"ACM Trans. Math. Softw."},{"key":"9461_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01585170","volume":"62","author":"R. Correa","year":"1993","unstructured":"Correa, R., Lemar\u00e9chal, C.: Convergence of some algorithms for convex minimization. Math. Program. 62, 261\u2013275 (1993)","journal-title":"Math. Program."},{"key":"9461_CR5","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"J.E. Dennis","year":"1983","unstructured":"Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs (1983)"},{"key":"9461_CR6","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF01589113","volume":"45","author":"J.C. Gilbert","year":"1989","unstructured":"Gilbert, J.C., Lemar\u00e9chal, C.: Some numerical experiments with variable-storage quasi-Newton algorithms. Math. Program. 45, 407\u2013435 (1989)","journal-title":"Math. Program."},{"key":"9461_CR7","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF02162162","volume":"10","author":"A.A. Goldstein","year":"1967","unstructured":"Goldstein, A.A., Price, J.F.: An effective algorithm for minimization. Numer. Math. 10, 184\u2013189 (1967)","journal-title":"Numer. Math."},{"issue":"2","key":"9461_CR8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10589-007-9067-3","volume":"39","author":"W.W. Hager","year":"2008","unstructured":"Hager, W.W., Zhang, H.: Self-adaptive inexact proximal point methods. Comput. Optim. Appl. 39(2), 161\u2013181 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"9461_CR9","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s11081-005-6798-9","volume":"6","author":"C. Humes","year":"2005","unstructured":"Humes, C., Silva, P.J.S.: Inexact proximal point algorithms and descent methods in optimization. Optim. Eng. 6, 257\u2013271 (2005)","journal-title":"Optim. Eng."},{"issue":"3","key":"9461_CR10","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF02614390","volume":"76","author":"C. Lemar\u00e9chal","year":"1997","unstructured":"Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.: Variable metric bundle methods: from conceptual to implementable forms. Math. Program. 76(3), 393\u2013410 (1997)","journal-title":"Math. Program."},{"key":"9461_CR11","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1090\/qam\/10666","volume":"2","author":"K. Levenberg","year":"1944","unstructured":"Levenberg, K.: A method for the solution of certain nonlinear problems in least squares. Q. Appl. Math. 2, 164\u2013168 (1944)","journal-title":"Q. Appl. Math."},{"issue":"23\u201324","key":"9461_CR12","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1016\/j.crma.2009.09.026","volume":"347","author":"P. Mar\u00e9chal","year":"2009","unstructured":"Mar\u00e9chal, P., Rondepierre, A.: A proximal approach to the inversion of ill-conditioned matrices. C.\u00a0R. Acad. Sci. Paris 347(23\u201324), 1435\u20131438 (2009)","journal-title":"C.\u00a0R. Acad. Sci. Paris"},{"key":"9461_CR13","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0111030","volume":"11","author":"D.W. Marquardt","year":"1963","unstructured":"Marquardt, D.W.: An algorithm for least-squares estimation of nonlinear parameters. J. Soc. Ind. Appl. Math. 11, 431\u2013441 (1963)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"9461_CR14","first-page":"154","volume":"R3","author":"B. Martinet","year":"1970","unstructured":"Martinet, B.: R\u00e9gularisation d\u2019in\u00e9quations variationelles par approximation successives. Rev. Fr. Inform. Rech. Oper. R3, 154\u2013158 (1970)","journal-title":"Rev. Fr. Inform. Rech. Oper."},{"key":"9461_CR15","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-642-68874-4_11","volume-title":"Mathematical Programming, the State of the Art","author":"J.J. Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J.J.: Recent developments in algorithms and software for trust region methods. In: Bachem, A., Gr\u00f6tschel, M., Korte, B. (eds.) Mathematical Programming, the State of the Art, pp.\u00a0258\u2013287. Springer, Berlin (1983)"},{"key":"9461_CR16","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J. Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35, 773\u2013782 (1980)","journal-title":"Math. Comput."},{"key":"9461_CR17","doi-asserted-by":"crossref","unstructured":"Qi, L., Sun, J.: nonsmooth version of Newton\u2019s method. Math. Program. (1993)","DOI":"10.1007\/BF01581275"},{"key":"9461_CR18","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"R.T. Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1, 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9461_CR19","first-page":"059","volume":"6","author":"M.V. Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A hybrid projection-proximal point algorithm. J. Convex Anal. 6(1), 059\u2013070 (1999)","journal-title":"J. Convex Anal."},{"key":"9461_CR20","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1081\/NFA-100108320","volume":"22","author":"M.V. Solodov","year":"2001","unstructured":"Solodov, M.V., Svaiter, B.F.: A unified framework for some inexact proximal point algorithms. Numer. Funct. Anal. Optim. 22, 1013\u20131035 (2001)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"9461_CR21","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1093\/imanum\/9.3.435","volume":"9","author":"M. Todd","year":"1989","unstructured":"Todd, M.: On convergence properties of algorithms for unconstrained minimization. IMA J. Numer. Anal. 9, 435\u2013441 (1989)","journal-title":"IMA J. Numer. Anal."},{"key":"9461_CR22","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P. Wolfe","year":"1969","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. SIAM Rev. 11, 226\u2013235 (1969)","journal-title":"SIAM Rev."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9461-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-012-9461-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9461-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:42Z","timestamp":1559288202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-012-9461-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,9]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9461"],"URL":"https:\/\/doi.org\/10.1007\/s10589-012-9461-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,9]]}}}