{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:26:47Z","timestamp":1773797207640,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T00:00:00Z","timestamp":1175731200000},"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":[[2007,11,11]]},"DOI":"10.1007\/s10589-007-9025-0","type":"journal-article","created":{"date-parts":[[2007,4,4]],"date-time":"2007-04-04T12:30:00Z","timestamp":1175689800000},"page":"305-327","source":"Crossref","is-referenced-by-count":10,"title":["Nonmonotone projected gradient methods based on barrier and Euclidean distances"],"prefix":"10.1007","volume":"38","author":[{"given":"Alfred","family":"Auslender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paulo J. S.","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Teboulle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,5]]},"reference":[{"key":"9025_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.1030.0062","volume":"29","author":"A. Auslender","year":"2004","unstructured":"Auslender, A., Teboulle, M.: Interior Gradient and Epsilon-subgradient methods for constrained convex minimization. Math. Oper. Res. 29, 1\u201326 (2004)","journal-title":"Math. Oper. Res."},{"key":"9025_CR2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10107-004-0568-x","volume":"104","author":"A. Auslender","year":"2005","unstructured":"Auslender, A., Teboulle, M.: Interior projection-like methods for monotone variational inequalities. Math. Program. 104, 39\u201368 (2005)","journal-title":"Math. Program."},{"key":"9025_CR3","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A. Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16, 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"9025_CR4","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/moor.24.3.645","volume":"24","author":"A. Auslender","year":"1999","unstructured":"Auslender, A., Teboulle, M., Ben-Tiba, S.: Interior proximal and multiplier methods based on second order homogeneous kernels. Math. Oper. Res. 24, 645\u2013668 (1999)","journal-title":"Math. Oper. Res."},{"key":"9025_CR5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A. Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31, 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"key":"9025_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1137\/S1052623499354564","volume":"12","author":"A. Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Margalit, T., Nemirovsky, A.: The ordered subsets mirror descent optimization method with applications to tomography. SIAM J. Optim. 12, 79\u2013108 (2001)","journal-title":"SIAM J. Optim."},{"key":"9025_CR7","volume-title":"Nonlinear Programming","author":"D. Bertsekas","year":"1999","unstructured":"Bertsekas, D.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"key":"9025_CR8","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"E.G. Birgin","year":"2000","unstructured":"Birgin, E.G., Martinez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10, 1196\u20131211 (2000)","journal-title":"SIAM J. Optim."},{"key":"9025_CR9","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1145\/502800.502803","volume":"27","author":"E.G. Birgin","year":"2001","unstructured":"Birgin, E.G., Martinez, J.M., Raydan, M.: Algorithm 813:SPG: Software for convexly constrained optimization. ACM Trans. Math. Softw. 27, 340\u2013349 (2001)","journal-title":"ACM Trans. Math. Softw."},{"key":"9025_CR10","first-page":"139","volume":"15","author":"Y.H. Dai","year":"2002","unstructured":"Dai, Y.H.: A nonmonotone conjugate gradient algorithm for unconstrained optimization. J. System Sci. Complex 15, 139\u2013145 (2002)","journal-title":"J. System Sci. Complex"},{"key":"9025_CR11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E. Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"9025_CR12","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"N.I.M. Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29, 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"9025_CR13","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.: A monotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23, 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"9025_CR14","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF00940345","volume":"60","author":"L. Grippo","year":"1989","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A truncated Newton method with nonmonotone line search for unconstrained minimization. J. Optim. Theory Appl. 60, 401\u2013419 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"9025_CR15","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1137\/S1052623495295250","volume":"8","author":"S. Lucidi","year":"1998","unstructured":"Lucidi, S., Rochetich, F., Roma, M.: Curvilinear stabilization techniques for truncated Newton methods in large -scale unconstrained optimization. SIAM J. Optim. 8, 916\u2013939 (1998)","journal-title":"SIAM J. Optim."},{"key":"9025_CR16","volume-title":"Introduction to Optimization","author":"B.T. Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, New York (1987)"},{"key":"9025_CR17","volume-title":"Numerical Recipes in C: the Art of Scientific Computing","author":"W.H. Press","year":"1992","unstructured":"Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical Recipes in C: the Art of Scientific Computing, 2nd edn. Cambridge University Press, Cambridge (1992)","edition":"2"},{"key":"9025_CR18","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"E.R. Raydan","year":"1997","unstructured":"Raydan, E.R.: The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J. Optim. 7, 26\u201333 (1997)","journal-title":"SIAM J. Optim."},{"key":"9025_CR19","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"9025_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"R.T. Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, New York (1998)"},{"key":"9025_CR21","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1137\/S1052623499365784","volume":"12","author":"P.J.S. Silva","year":"2001","unstructured":"Silva, P.J.S., Eckstein, J., Humes, C.: Rescaling and stepsize selection in proximal methods using separable generalized distances. SIAM J. Optim. 12, 238\u2013261 (2001)","journal-title":"SIAM J. Optim."},{"key":"9025_CR22","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H. Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14, 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9025-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9025-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9025-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:31Z","timestamp":1559288191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9025-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4,5]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,11,11]]}},"alternative-id":["9025"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9025-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4,5]]}}}