{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:33:26Z","timestamp":1648895606663},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,9,21]],"date-time":"2007-09-21T00:00:00Z","timestamp":1190332800000},"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":[[2008,3]]},"DOI":"10.1007\/s10589-007-9067-3","type":"journal-article","created":{"date-parts":[[2007,9,20]],"date-time":"2007-09-20T15:07:57Z","timestamp":1190300877000},"page":"161-181","source":"Crossref","is-referenced-by-count":22,"title":["Self-adaptive inexact proximal point methods"],"prefix":"10.1007","volume":"39","author":[{"given":"William W.","family":"Hager","sequence":"first","affiliation":[]},{"given":"Hongchao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,21]]},"reference":[{"key":"9067_CR1","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.I.M., Toint, P.L.: CUTE: constrained and unconstrained testing environments. ACM Trans. Math. Softw. 21, 123\u2013160 (1995)","journal-title":"ACM Trans. Math. Softw."},{"key":"9067_CR2","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1137\/S0363012903427336","volume":"43","author":"P.L. Combettes","year":"2004","unstructured":"Combettes, P.L., Pennanen, T.: Proximal methods for cohypomonotone operators. SIAM J. Control 43, 731\u2013742 (2004)","journal-title":"SIAM J. Control"},{"key":"9067_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s00607-004-0083-1","volume":"74","author":"J. Fan","year":"2005","unstructured":"Fan, J., Yuan, Y.: On the convergence of the Levenberg-Marquardt method without nonsingularity assumption. Computing 74, 23\u201339 (2005)","journal-title":"Computing"},{"key":"9067_CR4","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/0328029","volume":"28","author":"C.D. Ha","year":"1990","unstructured":"Ha, C.D.: A generalization of the proximal point algorithm. SIAM J. Control 28, 503\u2013512 (1990)","journal-title":"SIAM J. Control"},{"key":"9067_CR5","unstructured":"Hager, W.W., Zhang, H.: CG_DESCENT user\u2019s guide. Tech. Rep., Department of Mathematics, University of Florida, Gainesville (2004)"},{"key":"9067_CR6","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"W.W. Hager","year":"2005","unstructured":"Hager, W.W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"key":"9067_CR7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"W.W. Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: Algorithm 851: CG_DESCENT, a conjugate gradient method with guaranteed descent. ACM Trans. Math. Softw. 32, 113\u2013137 (2006)","journal-title":"ACM Trans. Math. Softw."},{"key":"9067_CR8","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.: Inexact proximal point algorithms and descent methods in optimization. Optim. Eng. 6, 257\u2013271 (2005)","journal-title":"Optim. Eng."},{"key":"9067_CR9","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1137\/S1052623401399587","volume":"13","author":"A.N. Iusem","year":"2003","unstructured":"Iusem, A.N., Pennanen, T., Svaiter, B.F.: Inexact variants of the proximal point algorithm without monotonicity. SIAM J. Optim. 13, 1080\u20131097 (2003)","journal-title":"SIAM J. Optim."},{"key":"9067_CR10","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1023\/A:1008321423879","volume":"13","author":"A. Kaplan","year":"1998","unstructured":"Kaplan, A., Tichatschke, R.: Proximal point methods and nonconvex optimization. J. Glob. Optim. 13, 389\u2013406 (1998)","journal-title":"J. Glob. Optim."},{"key":"9067_CR11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/B:COAP.0000026881.96694.32","volume":"28","author":"D. Li","year":"2004","unstructured":"Li, D., Fukushima, M., Qi, L., Yamashita, N.: Regularized Newton methods for convex minimization problems with singular solutions. Comput. Optim. Appl. 28, 131\u2013147 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"9067_CR12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0322019","volume":"22","author":"F.J. Luque","year":"1984","unstructured":"Luque, F.J.: Asymptotic convergence analysis of the proximal point algorithm. SIAM J. Control 22, 277\u2013293 (1984)","journal-title":"SIAM J. Control"},{"key":"9067_CR13","first-page":"154","volume":"4","author":"B. Martinet","year":"1970","unstructured":"Martinet, B.: R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives. Rev. Francaise Inf. Rech. Oper. Ser. R-3 4, 154\u2013158 (1970)","journal-title":"Rev. Francaise Inf. Rech. Oper. Ser. R-3"},{"key":"9067_CR14","first-page":"163","volume":"274","author":"B. Martinet","year":"1972","unstructured":"Martinet, B.: Determination approach\u00e9e d\u2019un point fixe d\u2019une application pseudo-contractante. C.R. S\u00e9ances Acad. Sci. 274, 163\u2013165 (1972)","journal-title":"C.R. S\u00e9ances Acad. Sci."},{"key":"9067_CR15","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/moor.27.1.170.331","volume":"27","author":"T. Pennanen","year":"2002","unstructured":"Pennanen, T.: Local convergence of the proximal point algorithm and multiplier methods without monotonicity. Math. Oper. Res. 27, 170\u2013191 (2002)","journal-title":"Math. Oper. Res."},{"key":"9067_CR16","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"2","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. 2, 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"key":"9067_CR17","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R.T. Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control 14, 877\u2013898 (1976)","journal-title":"SIAM J. Control"},{"key":"9067_CR18","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-1-4757-3226-9_24","volume-title":"Nonlinear Optimization and Related Topics","author":"P. Tseng","year":"2000","unstructured":"Tseng, P.: Error bounds and superlinear convergence analysis of some Newton-type methods in optimization. In: Pillo, G.D., Giannessi, F. (eds.) Nonlinear Optimization and Related Topics, pp. 445\u2013462. Kluwer, Dordrecht (2000)"},{"key":"9067_CR19","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."},{"key":"9067_CR20","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1137\/1013035","volume":"13","author":"P. Wolfe","year":"1971","unstructured":"Wolfe, P.: Convergence conditions for ascent methods II: some corrections. SIAM Rev. 13, 185\u2013188 (1971)","journal-title":"SIAM Rev."},{"key":"9067_CR21","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/S105262349935949X","volume":"11","author":"N. Yamashita","year":"2000","unstructured":"Yamashita, N., Fukushima, M.: The proximal point algorithm with genuine superlinear convergence for the monotone complementarity problem. SIAM J. Optim. 11, 364\u2013379 (2000)","journal-title":"SIAM J. Optim."},{"key":"9067_CR22","series-title":"Comput. Suppl.","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-7091-6217-0_18","volume-title":"Topics in Numerical Analysis","author":"N. Yamashita","year":"2001","unstructured":"Yamashita, N., Fukushima, M.: On the rate of convergence of the Levenberg-Marquardt method. In: Topics in Numerical Analysis. Comput. Suppl., vol. 15, pp. 239\u2013249. Springer, New York (2001)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9067-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9067-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9067-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:32Z","timestamp":1559302592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9067-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,21]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["9067"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9067-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,21]]}}}