{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T17:08:38Z","timestamp":1724692118063},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,10,27]],"date-time":"2009-10-27T00:00:00Z","timestamp":1256601600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s11590-009-0150-9","type":"journal-article","created":{"date-parts":[[2009,10,26]],"date-time":"2009-10-26T04:56:59Z","timestamp":1256533019000},"page":"131-146","source":"Crossref","is-referenced-by-count":8,"title":["Starting-point strategies for an infeasible potential reduction method"],"prefix":"10.1007","volume":"4","author":[{"given":"Marco","family":"D\u2019Apuzzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentina","family":"De Simone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniela","family":"di Serafino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,27]]},"reference":[{"key":"150_CR1","doi-asserted-by":"crossref","unstructured":"Byrd R., Nocedal J., Waltz R.: KNITRO: an integrated package for nonlinear optimization. In: Di Pillo, G., Roma, M. Large-Scale Nonlinear Optimization, pp. 35\u201359. Springer, Berlin (2006)","DOI":"10.1007\/0-387-30065-1_4"},{"key":"150_CR2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10589-007-9035-y","volume":"38","author":"S. Cafieri","year":"2007","unstructured":"Cafieri S., D\u2019Apuzzo M., De Simone V., di Serafino D.: On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems. Comput. Optim. Appl. 38, 27\u201345 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"150_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10589-006-9007-7","volume":"36","author":"S. Cafieri","year":"2007","unstructured":"Cafieri S., D\u2019Apuzzo M., De Simone V., di Serafino D.: Stopping criteria for inner iterations in inexact Potential Reduction methods: a computational study. Comput. Optim. Appl. 36, 165\u2013193 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"150_CR4","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10957-007-9264-3","volume":"135","author":"S. Cafieri","year":"2007","unstructured":"Cafieri S., D\u2019Apuzzo M., De Simone V., di Serafino D., Toraldo G.: Convergence analysis of an inexact potential reduction method for convex quadratic programming. J. Optim. Theory Appl. 135, 355\u2013366 (2007)","journal-title":"J. Optim. Theory Appl."},{"key":"150_CR5","doi-asserted-by":"crossref","unstructured":"Cafieri, S., D\u2019Apuzzo, M., De Simone, V., di Serafino, D.: On the use of an approximate constraint preconditioner in a potential reduction algorithm for quadratic programming. In: Cutello, V., Fotia, G., Puccio, L. (eds.) Applied and Industrial Mathematics in Italy II, Series on Advances in Mathematics for Applied Sciences, vol. 75, pp. 220\u2013230. World Scientific, Singapore (2007)","DOI":"10.1142\/9789812709394_0020"},{"key":"150_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10957-006-9043-6","volume":"129","author":"S. Cafieri","year":"2006","unstructured":"Cafieri S., D\u2019Apuzzo M., Marino M., Mucherino A., Toraldo G.: Interior point solver for large-scale quadratic programming problems with bound constraints. J. Optim. Theory Appl. 129, 55\u201375 (2006)","journal-title":"J. Optim. Theory Appl."},{"key":"150_CR7","doi-asserted-by":"crossref","unstructured":"D\u2019Apuzzo, M., De Simone, V., di Serafino, D.: On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods. Comput. Optim. Appl. (2008). doi: 10.1007\/s10589-008-9226-1","DOI":"10.1007\/s10589-008-9226-1"},{"key":"150_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan E.D., Mor\u00e9 J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"150_CR9","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/j.aml.2003.09.005","volume":"17","author":"E.M. Gertz","year":"2004","unstructured":"Gertz E.M., Nocedal J., Sartenaer A.: Starting-point strategy for nonlinear interior methods. Appl. Math. Lett. 17, 945\u2013952 (2004)","journal-title":"Appl. Math. Lett."},{"key":"150_CR10","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":"150_CR11","unstructured":"Gertz, E.M., Wright, S.J.: Object-oriented software for quadratic programming. ACM Trans. Math. Softw. 29, 58\u201381 (2003). See also http:\/\/www.cs.wisc.edu\/~swright\/ooqp\/"},{"key":"150_CR12","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"Mehrotra S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2, 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"key":"150_CR13","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/0805003","volume":"5","author":"S. Mizuno","year":"1995","unstructured":"Mizuno S., Kojima M., Todd M.J.: Infeasible-interior-point primal-dual potential-reduction algorithms for linear programming. SIAM J. Optim. 5, 52\u201367 (1995)","journal-title":"SIAM J. Optim."},{"key":"150_CR14","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1080\/10556789908805759","volume":"1","author":"R.J. Vanderbei","year":"1999","unstructured":"Vanderbei R.J.: An interior point code for quadratic programming. Optim. Methods Softw. 1, 451\u2013484 (1999)","journal-title":"Optim. Methods Softw."},{"key":"150_CR15","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-dual interior-point methods","author":"S.J. Wright","year":"1997","unstructured":"Wright S.J.: Primal-dual interior-point methods. SIAM, Philadelphia (1997)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-009-0150-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-009-0150-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-009-0150-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T11:15:04Z","timestamp":1559560504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-009-0150-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,27]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["150"],"URL":"https:\/\/doi.org\/10.1007\/s11590-009-0150-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,27]]}}}