{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T04:34:30Z","timestamp":1712896470991},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"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":["J Syst Sci Complex"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s11424-014-1273-3","type":"journal-article","created":{"date-parts":[[2014,9,30]],"date-time":"2014-09-30T04:16:45Z","timestamp":1412050605000},"page":"1027-1044","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A full-Newton step infeasible interior-point algorithm for P *(\u03ba) linear complementarity problem"],"prefix":"10.1007","volume":"27","author":[{"given":"Danhua","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Mingwang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,1]]},"reference":[{"key":"1273_CR1","volume-title":"The Linear Complementarity","author":"R W Cottle","year":"1992","unstructured":"Cottle R W, Pang J, and Stone R E, The Linear Complementarity, Academic Press, Boston, 1992."},{"key":"1273_CR2","volume-title":"Interior Point Methods for Linear Optimization","author":"C Roos","year":"2006","unstructured":"Roos C, Terlaky T, and Vial J P, Interior Point Methods for Linear Optimization, Springer, New York, 2006."},{"key":"1273_CR3","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, PA, 1997."},{"issue":"3","key":"1273_CR4","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/j.ejor.2005.08.031","volume":"181","author":"T Illes","year":"2007","unstructured":"Illes T and Nany M, A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems, European Journal of Operational Research, 2007, 181(3): 1097\u20131111.","journal-title":"European Journal of Operational Research"},{"key":"1273_CR5","volume-title":"Lecture Notes in Computer Science","author":"M Kojima","year":"1991","unstructured":"Kojima M, Megiddo N, Noma T, et al., A unified approach to interior-point algorithms for linear complementarity problems, Lecture Notes in Computer Science, Springer, New York, 1991."},{"key":"1273_CR6","first-page":"355","volume":"69","author":"J Mao","year":"1995","unstructured":"Mao J, A quadratically convergent O((\u03ba+1) $\\sqrt n $ L)-iteration algorithm for the P *(\u03ba)-matrix linear complementarity problems, Mathematical Programming, 1995, 69: 355\u2013368.","journal-title":"Mathematical Programming"},{"issue":"4","key":"1273_CR7","first-page":"223","volume":"76","author":"P A Potra","year":"1997","unstructured":"Potra P A and Sheng R, Predictor-corrector algorithm for solving P *(\u03ba) matrix LCP from arbitrary positive starting points, Mathematical Programming, 1997, 76(4): 223\u2013244.","journal-title":"Mathematical Programming"},{"key":"1273_CR8","first-page":"177","volume":"19","author":"Z Wang","year":"2001","unstructured":"Wang Z, Huang Z, and Zhou K, An asymptotical O((\u03ba + 1)n 3 L) affine scaling algorithm for the P *(\u03ba)-matrix LCP, Journal of Computational Mathematics, 2001, 19: 177\u2013186.","journal-title":"Journal of Computational Mathematics"},{"key":"1273_CR9","volume-title":"Kernel Function-Based Interior-Point Algorithms for Conic Optimization","author":"Y Bai","year":"2010","unstructured":"Bai Y, Kernel Function-Based Interior-Point Algorithms for Conic Optimization, Science Press, Beijing, 2010."},{"key":"1273_CR10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s101070200296","volume":"93","author":"J Peng","year":"2002","unstructured":"Peng J, Roos C, and Terlaky T, Self-regular functions and new search directions for linear and semidefinite optimizations, Mathematical Programming, 2002, 93: 129\u2013171.","journal-title":"Mathematical Programming"},{"key":"1273_CR11","volume-title":"Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms","author":"J Peng","year":"2002","unstructured":"Peng J, Roos C, and Terlaky T, Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms, Princeton University Press, 2002."},{"key":"1273_CR12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1137\/S1052623403423114","volume":"18","author":"Y Bai","year":"2004","unstructured":"Bai Y, Ghami M E L, and Roos C, A comparative study of kernel functions for primal-dual interiorpoint algorithms in linear optimization, SIAM Journal of Optimization, 2004, 18: 101\u2013128.","journal-title":"SIAM Journal of Optimization"},{"issue":"4","key":"1273_CR13","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1137\/050623917","volume":"16","author":"C Roos","year":"2006","unstructured":"Roos C, A full-Newton step O(n) infeasible interior-point algorithm for linear Optimization, SIAM Journal of Optimization, 2006, 16(4): 1110\u20131136.","journal-title":"SIAM Journal of Optimization"},{"issue":"3","key":"1273_CR14","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1080\/10556780600816692","volume":"22","author":"H Mansouri","year":"2007","unstructured":"Mansouri H and Roos C, Simplied O(n) infeasible interior-point algorithm for linear programming using full Newton steps, Optimization Methods and Software, 2007, 22(3): 519\u2013530.","journal-title":"Optimization Methods and Software"},{"key":"1273_CR15","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.nonrwa.2010.06.039","volume":"12","author":"H Mansouri","year":"2011","unstructured":"Mansouri H, Zangiabadi M, and Pirhaji M, A full-Newton step O(n) infeasible interior-point algorithm for linear complementarity problems, Nonlinear Analysis: Real World Applications, 2011, 12: 545\u2013561.","journal-title":"Nonlinear Analysis: Real World Applications"},{"key":"1273_CR16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00245-009-9069-x","volume":"60","author":"Z Liu","year":"2009","unstructured":"Liu Z, Sun W, and Tian F, A full-Newton step O(n) infeasible interior-point algorithm for linear programming based on kernel function, Applied Mathematics and Optimization, 2009, 60: 237\u2013251.","journal-title":"Applied Mathematics and Optimization"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-014-1273-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-014-1273-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-014-1273-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:54:06Z","timestamp":1559386446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-014-1273-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["1273"],"URL":"https:\/\/doi.org\/10.1007\/s11424-014-1273-3","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10]]}}}