{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:58:17Z","timestamp":1770973097221,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,8,14]],"date-time":"2006-08-14T00:00:00Z","timestamp":1155513600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,8,14]],"date-time":"2006-08-14T00:00:00Z","timestamp":1155513600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2006,11]]},"DOI":"10.1007\/s10589-006-9759-0","type":"journal-article","created":{"date-parts":[[2006,8,18]],"date-time":"2006-08-18T02:07:57Z","timestamp":1155866877000},"page":"347-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Nonlinear Rescaling as Interior Quadratic Prox Method in Convex Optimization"],"prefix":"10.1007","volume":"35","author":[{"given":"Roman A.","family":"Polyak","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,8,14]]},"reference":[{"key":"9759_CR1","doi-asserted-by":"crossref","unstructured":"A. Auslender, R. Cominetti, and M. Haddou, \u201cAsymptotic analysis of penalty and barrier methods in convex and linear programming,\u201d Math. Oper. Res., vol. 22, pp. 43\u201362, 1997.","DOI":"10.1287\/moor.22.1.43"},{"issue":"3","key":"9759_CR2","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1287\/moor.24.3.645","volume":"24","author":"A. Auslender","year":"1999","unstructured":"A. Auslender, M. Teboulle, and S. Ben-Tiba, \u201cInterior proximal and multipliers methods based on second-order homogeneous kernels,\u201d Math. Oper. Res., vol. 24, no. 3, pp. 645\u2013668, 1999.","journal-title":"Math. Oper. Res."},{"key":"9759_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF01742459","volume":"7","author":"M.P. Bends\u00f8e","year":"1994","unstructured":"M.P. Bends\u00f8e, A. Ben-Tal, and J. Zowe, \u201cOptimization methods for truss geometry and topology design,\u201d Structural Optimization, vol. 7, pp. 141\u2013159, 1994.","journal-title":"Structural Optimization"},{"key":"9759_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1137\/S1052623493259215","volume":"7","author":"A. Ben-Tal","year":"1997","unstructured":"A. Ben-Tal and M. Zibulevsky, \u201cPenalty-barrier methods for convex programming problems,\u201d SIAM J. Optim., vol. 7, pp. 347\u2013366, 1997.","journal-title":"SIAM J. Optim."},{"key":"9759_CR5","unstructured":"A. Ben-Tal, B. Yuzefovich, and M. Zibulevsky, \u201cPenalty-barrier multipliers methods for minimax and constrained smooth convex optimization,\u201d Optimization Laboratory, Technion, Israel, Research Report 9-92, 1992."},{"key":"9759_CR6","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/BF02206826","volume":"62","author":"M. Breitfelt","year":"1996","unstructured":"M. Breitfelt and D. Shanno, \u201cExperience with modified log-barrier method for nonlinear programming,\u201d Ann. Oper. Res., vol. 62, pp. 439\u2013464, 1996.","journal-title":"Ann. Oper. Res."},{"key":"9759_CR7","volume-title":"Constrained Optimization and Lagrange Multipliers Methods","author":"D. Bertsekas","year":"1982","unstructured":"D. Bertsekas, Constrained Optimization and Lagrange Multipliers Methods. Academic Press: New York, 1982."},{"key":"9759_CR8","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971316","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Classics in Applied Mathematics","author":"A. Fiacco","year":"1990","unstructured":"A. Fiacco and G. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Classics in Applied Mathematics. SIAM: Philadelphia, PA. 1990."},{"key":"9759_CR9","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0329022","volume":"29","author":"O. Guler","year":"1991","unstructured":"O. Guler, \u201cOn the convergence of the proximal point algorithm for convex minimization,\u201d SIAM J. Control Optim., vol. 29, pp. 403\u2013419, 1991.","journal-title":"SIAM J. Control Optim."},{"key":"9759_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"M.R. Hestenes","year":"1969","unstructured":"M.R. Hestenes, \u201cMultipliers and gradient methods,\u201d J. Optim. Theory Appl., vol. 4, pp. 303\u2013320, 1969.","journal-title":"J. Optim. Theory Appl."},{"key":"9759_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"A. Hoffman","year":"1952","unstructured":"A. Hoffman, \u201cOn approximate solution of system of linear inequalities,\u201d Journal of Research of the National Bureau of Standards, vol. 49, pp. 263\u2013265, 1952.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"9759_CR12","unstructured":"K. Knopp, Infinite Sequence and Series, Dover Publication Inc.: New York, 1956."},{"key":"9759_CR13","doi-asserted-by":"crossref","unstructured":"B.W. Kort and D.P. Bertsekas, \u201cMultiplier methods for convex programming,\u201d in Proc. IEEE Conf. on Decision and Control, San Diego, CA., 1973, pp. 428\u2013432.","DOI":"10.1109\/CDC.1973.269203"},{"key":"9759_CR14","first-page":"154","volume":"4","author":"B. Martinet","year":"1970","unstructured":"B. Martinet, \u201cRegularization d\u2019inequations variationelles par approximations successive,\u201d Revue Francaise d\u2019Automatique et Informatique Rechershe Operationelle, vol. 4, pp. 154\u2013159, 1970.","journal-title":"Revue Francaise d\u2019Automatique et Informatique Rechershe Operationelle"},{"key":"9759_CR15","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF02206827","volume":"62","author":"A. Melman","year":"1996","unstructured":"A. Melman and R. Polyak, \u201cThe Newton modified barrier method for QP problems,\u201d Ann. Oper. Res., vol. 62, pp. 465\u2013519, 1996.","journal-title":"Ann. Oper. Res."},{"key":"9759_CR16","doi-asserted-by":"crossref","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"J. Moreau","year":"1965","unstructured":"J. Moreau, \u201cProximit\u00e9 et dualit\u00e9 dans un espace Hilbertien,\u201d Bull. Soc. Math. France, vol. 93, pp. 273\u2013299, 1965.","journal-title":"Bull. Soc. Math. France"},{"key":"9759_CR17","doi-asserted-by":"crossref","unstructured":"S. Nash, R. Polyak, and A. Sofer, \u201cA numerical comparison of barrier and modified barrier method for large-scale bound-constrained optimization,\u201d in Large Scale Optimization, State of the Art. W. Hager, D. Hearn, P. Pardalos (Eds.), Kluwer Academic Publishers, 1994, pp. 319\u2013338.","DOI":"10.1007\/978-1-4613-3632-7_16"},{"key":"9759_CR18","volume-title":"Introduction to Optimization","author":"B. Polyak","year":"1987","unstructured":"B. Polyak, Introduction to Optimization, Software Inc.: NY, 1987."},{"key":"9759_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01586050","volume":"54","author":"R. Polyak","year":"1992","unstructured":"R. Polyak, \u201cModified barrier functions (theory and methods),\u201d Math. Programming, vol. 54, pp. 177\u2013222, 1992.","journal-title":"Math. Programming"},{"key":"9759_CR20","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1023\/A:1010938423538","volume":"101","author":"R. Polyak","year":"2001","unstructured":"R. Polyak, \u201cLog-sigmoid multipliers method in constrained optimization,\u201d Ann. Oper. Res., vol. 101, pp. 427\u2013460, 2001.","journal-title":"Ann. Oper. Res."},{"key":"9759_CR21","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s101070100293","volume":"92","author":"R. Polyak","year":"2002","unstructured":"R. Polyak, \u201cNonlinear rescaling vs. smoothing technique in convex optimization,\u201d Math. Programming, vol. 92, pp. 197\u2013235, 2002.","journal-title":"Math. Programming"},{"key":"9759_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/B:JOTA.0000041733.24606.99","volume":"122","author":"R. Polyak","year":"2004","unstructured":"R. Polyak and I. Griva, \u201cPrimal-dual nonlinear rescaling methods for convex optimization,\u201d J. Optim. Theory Appl., vol 122, pp 111\u2013156, 2004.","journal-title":"J. Optim. Theory Appl."},{"key":"9759_CR23","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0025-5610(96)00032-9","volume":"76","author":"R. Polyak","year":"1997","unstructured":"R. Polyak and M. Teboulle, \u201cNonlinear rescaling and proximal-like methods in convex optimization,\u201d Math. Programming, vol. 76, pp. 265\u2013284, 1997.","journal-title":"Math. Programming"},{"key":"9759_CR24","doi-asserted-by":"crossref","unstructured":"R. Polyak, I. Griva, and J. Sobieski, \u201cThe Newton log-sigmoid method in constrained optimization. a collection of technical papers,\u201d 7th AIAA\/USAF\/NASA\/ ISSMO Symposium on Multidisciplinary Analysis and Optimization, vol. 3, 1998, pp. 2193\u20132201.","DOI":"10.2514\/6.1998-4797"},{"key":"9759_CR25","first-page":"283","volume-title":"Optimization","author":"M.J.D. Powell","year":"1969","unstructured":"M.J.D. Powell, \u201cA method for nonlinear constraints in minimization problems,\u201d in Fletcher (Ed.), Optimization, London Academic Press, 1969, pp. 283\u2013298."},{"key":"9759_CR26","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF01580138","volume":"5","author":"R.T. Rockafellar","year":"1973","unstructured":"R.T. Rockafellar, \u201cA dual approach to solving nonlinear programming problems by unconstrainted minimization,\u201d Math. Programming, vol. 5, pp. 354\u2013373, 1973.","journal-title":"Math. Programming"},{"key":"9759_CR27","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R.T. Rockafellar","year":"1976","unstructured":"R.T. Rockafellar, \u201cMonotone operators and the proximal point algorithm,\u201d SIAM J. Control Optim., vol. 14, pp. 877\u2013898, 1976.","journal-title":"SIAM J. Control Optim."},{"key":"9759_CR28","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"R.T. Rockafellar","year":"1976","unstructured":"R.T. Rockafellar, \u201cAugmented Lagrangians and applications of the proximal points algorithms in convex programming,\u201d Math. Oper. Res., vol. 1, pp. 97\u2013116, 1976.","journal-title":"Math. Oper. Res."},{"key":"9759_CR29","first-page":"231","volume":"13","author":"D.F. Shanno","year":"1999","unstructured":"D.F. Shanno and R.J. Vanderbei, \u201cAn interior point algorithm for nonconvex nonlinear programming,\u201d COAP, vol. 13, pp. 231\u2013252, 1999.","journal-title":"COAP"},{"key":"9759_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01580598","volume":"60","author":"P. Tseng","year":"1993","unstructured":"P. Tseng and D. Bertsekas, \u201cOn the convergence of the exponential multipliers method for convex programming,\u201d Math. Programming, vol. 60, pp. 1\u201319, 1993.","journal-title":"Math. Programming"},{"key":"9759_CR31","doi-asserted-by":"crossref","unstructured":"S. Wright, Primal-Dual Interior-Point Methods, SIAM, 1997.","DOI":"10.1137\/1.9781611971453"},{"key":"9759_CR32","volume-title":"Solving large-scale linear programs by interior-point methods under matlab environment","author":"Y. Zhang","year":"1996","unstructured":"Y. Zhang, \u201cSolving large-scale linear programs by interior-point methods under matlab environment,\u201d Dept. of Computational and Applied Mathmatics, Rice University, Houston, TX 77005, 1996."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-006-9759-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-006-9759-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-006-9759-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-006-9759-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,15]],"date-time":"2022-05-15T00:45:46Z","timestamp":1652575546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-006-9759-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,14]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,11]]}},"alternative-id":["9759"],"URL":"https:\/\/doi.org\/10.1007\/s10589-006-9759-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,14]]},"assertion":[{"value":"7 January 2004","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2005","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}