{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:04Z","timestamp":1740108244798,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T00:00:00Z","timestamp":1474416000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00186-016-0561-1","type":"journal-article","created":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T10:27:33Z","timestamp":1474453653000},"page":"43-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An inexact proximal regularization method for unconstrained optimization"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8821-5799","authenticated-orcid":false,"given":"Paul","family":"Armand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isa\u00ef","family":"Lankoand\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"issue":"3","key":"561_CR1","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10589-014-9679-3","volume":"59","author":"P Armand","year":"2014","unstructured":"Armand P, Benoist J, Omheni R, Pateloup V (2014) Study of a primal-dual algorithm for equality constrained minimization. Comput Optim Appl 59(3):405\u2013433","journal-title":"Comput Optim Appl"},{"issue":"5","key":"561_CR2","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1080\/10556788.2012.668905","volume":"28","author":"P Armand","year":"2013","unstructured":"Armand P, Benoist J, Orban D (2013) From global to local convergence of interior methods for nonlinear optimization. Optim Methods Softw 28(5):1051\u20131080","journal-title":"Optim Methods Softw"},{"key":"561_CR3","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2015.1025401","author":"P Armand","year":"2015","unstructured":"Armand P, Omheni R (2015) A globally and quadratically convergent primal-dual augmented lagrangian algorithm for equality constrained optimization. Optim Methods Softw. doi: 10.1080\/10556788.2015.1025401","journal-title":"Optim Methods Softw"},{"issue":"2","key":"561_CR4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10589-013-9626-8","volume":"58","author":"HY Benson","year":"2014","unstructured":"Benson HY, Shanno DF (2014) Interior-point methods for nonconvex nonlinear programming: cubic regularization. Comput Optim Appl 58(2):323\u2013346","journal-title":"Comput Optim Appl"},{"issue":"3","key":"561_CR5","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1137\/0726042","volume":"26","author":"RH Byrd","year":"1989","unstructured":"Byrd RH, Nocedal J (1989) A tool for the analysis of quasi-Newton methods with application to unconstrained minimization. SIAM J Numer Anal 26(3):727\u2013739","journal-title":"SIAM J Numer Anal"},{"issue":"2","key":"561_CR6","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"C Cartis","year":"2011","unstructured":"Cartis C, Gould NIM, Toint PL (2011) Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math Progr Ser A 127(2):245\u2013295","journal-title":"Math Progr Ser A"},{"issue":"2","key":"561_CR7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Progr Ser A 91(2):201\u2013213","journal-title":"Math Progr Ser A"},{"issue":"1","key":"561_CR8","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1080\/10556788.2012.746344","volume":"29","author":"J Fan","year":"2014","unstructured":"Fan J, Yuan Y (2014) A regularized Newton method for monotone nonlinear equations and its application. Optim Methods Softw 29(1):102\u2013119","journal-title":"Optim Methods Softw"},{"issue":"3","key":"561_CR9","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s10589-012-9461-3","volume":"53","author":"M Fuentes","year":"2012","unstructured":"Fuentes M, Malick J, Lemar\u00e9chal C (2012) Descentwise inexact proximal algorithms for smooth optimization. Comput Optim Appl 53(3):755\u2013769","journal-title":"Comput Optim Appl"},{"issue":"3","key":"561_CR10","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould NIM, Orban D, Toint PL (2015) CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput Optim Appl 60(3):545\u2013557","journal-title":"Comput Optim Appl"},{"issue":"4","key":"561_CR11","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo L, Lampariello F, Lucidi S (1986) A nonmonotone line search technique for Newton\u2019s method. SIAM J Numer Anal 23(4):707\u2013716","journal-title":"SIAM J Numer Anal"},{"issue":"2","key":"561_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10589-007-9067-3","volume":"39","author":"WW Hager","year":"2008","unstructured":"Hager WW, Zhang H (2008) Self-adaptive inexact proximal point methods. Comput Optim Appl 39(2):161\u2013181","journal-title":"Comput Optim Appl"},{"key":"561_CR13","volume-title":"Matrix analysis","author":"RA Horn","year":"1990","unstructured":"Horn RA, Johnson CR (1990) Matrix analysis. Cambridge University Press, Cambridge"},{"issue":"2","key":"561_CR14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s11081-005-6798-9","volume":"6","author":"C Humes Jr","year":"2005","unstructured":"Humes C Jr, Silva PJS (2005) Inexact proximal point algorithms and descent methods in optimization. Optim Eng 6(2):257\u2013271","journal-title":"Optim Eng"},{"issue":"2","key":"561_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/B:COAP.0000026881.96694.32","volume":"28","author":"DH Li","year":"2004","unstructured":"Li DH, Fukushima M, Qi L, Yamashita N (2004) Regularized Newton methods for convex minimization problems with singular solutions. Comput Optim Appl 28(2):131\u2013147","journal-title":"Comput Optim Appl"},{"issue":"1","key":"561_CR16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s10589-007-9128-7","volume":"43","author":"YJ Li","year":"2009","unstructured":"Li YJ, Li DH (2009) Truncated regularized Newton method for convex minimizations. Comput Optim Appl 43(1):119\u2013131","journal-title":"Comput Optim Appl"},{"issue":"3","key":"561_CR17","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh N, Boyd S (2014) Proximal algorithms. Found Trends Optim 1(3):127\u2013239","journal-title":"Found Trends Optim"},{"issue":"1","key":"561_CR18","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-007-0143-3","volume":"120","author":"RA Polyak","year":"2009","unstructured":"Polyak RA (2009) Regularized Newton method for unconstrained convex optimization. Math Progr Ser B 120(1):125\u2013145","journal-title":"Math Progr Ser B"},{"key":"561_CR19","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.cam.2014.03.023","volume":"269","author":"SA Santos","year":"2014","unstructured":"Santos SA, Silva RCM (2014) An inexact and nonmonotone proximal method for smooth unconstrained minimization. J Comput Appl Math 269:86\u2013100","journal-title":"J Comput Appl Math"},{"issue":"8","key":"561_CR20","doi-asserted-by":"crossref","first-page":"1913","DOI":"10.1007\/s11590-011-0386-z","volume":"6","author":"C Shen","year":"2012","unstructured":"Shen C, Chen X, Liang Y (2012) A regularized Newton method for degenerate unconstrained optimization problems. Optim Lett 6(8):1913\u20131933","journal-title":"Optim Lett"},{"issue":"1","key":"561_CR21","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s00245-009-9094-9","volume":"62","author":"K Ueda","year":"2010","unstructured":"Ueda K, Yamashita N (2010) Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization. Appl Math Optim 62(1):27\u201346","journal-title":"Appl Math Optim"},{"issue":"1\u20132","key":"561_CR22","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10589-014-9656-x","volume":"59","author":"K Ueda","year":"2014","unstructured":"Ueda K, Yamashita N (2014) A regularized Newton method without line search for unconstrained optimization. Comput Optim Appl 59(1\u20132):321\u2013351","journal-title":"Comput Optim Appl"},{"key":"561_CR23","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-7091-6217-0_18","volume-title":"Topics in numerical analysis, Comput Suppl","author":"N Yamashita","year":"2001","unstructured":"Yamashita N, Fukushima M (2001) On the rate of convergence of the Levenberg-Marquardt method. Topics in numerical analysis, Comput Suppl, vol 15. Springer, Vienna, pp 239\u2013249"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-016-0561-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-016-0561-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-016-0561-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T19:20:57Z","timestamp":1498332057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-016-0561-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,21]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["561"],"URL":"https:\/\/doi.org\/10.1007\/s00186-016-0561-1","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2016,9,21]]}}}