{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T09:29:37Z","timestamp":1662629377558},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,1,8]],"date-time":"2015-01-08T00:00:00Z","timestamp":1420675200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s11075-014-9955-4","type":"journal-article","created":{"date-parts":[[2015,1,7]],"date-time":"2015-01-07T02:28:40Z","timestamp":1420597720000},"page":"393-405","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO"],"prefix":"10.1007","volume":"70","author":[{"given":"Mohamed","family":"Achache","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moufida","family":"Goutali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,8]]},"reference":[{"key":"9955_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1590\/S0101-82052006000100005","volume":"25","author":"M Achache","year":"2006","unstructured":"Achache, M.: A new primal-dual path-following method for convex quadratic programming. Comput. Appl. Math. 25, 97\u2013110 (2006)","journal-title":"Comput. Appl. Math."},{"issue":"1","key":"9955_CR2","first-page":"48","volume":"LVII","author":"M Achache","year":"2012","unstructured":"Achache, M., Goutali, M.: A primal-dual interior point algorithm for convex quadratic programs. Studia Univ. Babes-Bolyai. Ser. Inform. LVII(1), 48\u201358 (2012)","journal-title":"Studia Univ. Babes-Bolyai. Ser. Inform."},{"issue":"1","key":"9955_CR3","first-page":"51","volume":"5","author":"Z Darvay","year":"2003","unstructured":"Darvay, Z.: New interior-point algorithms in linear programming. J. Adv. Model. optim. 5(1), 51\u201392 (2003)","journal-title":"J. Adv. Model. optim."},{"issue":"2","key":"9955_CR4","first-page":"121","volume":"LIV","author":"Z Darvay","year":"2009","unstructured":"Darvay, Z.: A predictor-corrector algorithm for linearly constrained convex optimization. Studia Univ. Babes-Bolyai. Ser. Inform. LIV(2), 121\u2013138 (2009)","journal-title":"Studia Univ. Babes-Bolyai. Ser. Inform."},{"issue":"N2","key":"9955_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/A:1021768121263","volume":"102","author":"LM Grana Drummond","year":"1999","unstructured":"Grana Drummond, L.M., Svaiter, B.F.: On well definedness of the central path. J. Optim. Theory Appl. 102(N2), 223\u2013237 (1999)","journal-title":"J. Optim. Theory Appl."},{"key":"9955_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1019280614748","volume":"49","author":"J Peng","year":"2000","unstructured":"Peng, J., Roos, C., Terlaky, T.: New complexity analysis of the primal-dual Newton method for linear optimization. Ann. Oper. Res. 49, 23\u201339 (2000)","journal-title":"Ann. Oper. Res."},{"key":"9955_CR7","volume-title":"Theory and Algorithms for linear optimization. An interior Point Approach","author":"C Roos","year":"1997","unstructured":"Roos, C., Terlaky, T., Vial, J.Ph.: Theory and Algorithms for linear optimization. An interior Point Approach. John-Wiley Sons, Chichester (1997)"},{"key":"9955_CR8","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior point algorithms. Theory and Analysis","author":"Y Ye","year":"1997","unstructured":"Ye, Y.: Interior point algorithms. Theory and Analysis. John-Wiley Sons, Chichester (1997)"},{"issue":"6","key":"9955_CR9","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s11741-008-0602-3","volume":"12","author":"M Zhang","year":"2008","unstructured":"Zhang, M, Bai, Y., Wang, G.: A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization. J. Shanghai Univ. 12(6), 475\u2013780 (2008)","journal-title":"J. Shanghai Univ."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9955-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-014-9955-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9955-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T14:01:13Z","timestamp":1559570473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-014-9955-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,8]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9955"],"URL":"https:\/\/doi.org\/10.1007\/s11075-014-9955-4","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,8]]}}}