{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T10:02:04Z","timestamp":1648807324066},"reference-count":16,"publisher":"International Academy Publishing (IAP)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCP"],"DOI":"10.4304\/jcp.6.8.1562-1569","type":"journal-article","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T11:50:25Z","timestamp":1312890625000},"source":"Crossref","is-referenced-by-count":0,"title":["A Mixed Algorithm for Nonlinear Complementarity Problems"],"prefix":"10.17706","volume":"6","author":[{"given":"Xi-yun","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ya","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-yang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7163","published-online":{"date-parts":[[2011,8,1]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144595285963"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.23.3.719"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050082"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050009"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0614081"},{"key":"ref6","volume-title":"Theory and Algorithms for Nonlinear Complementarity.","author":"Han","year":"2006"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591949"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591750"},{"key":"ref9","first-page":"973","article-title":"\"A smoothing self-trust region method for the NCP(F),\" J.","volume":"35","author":"Dong","year":"2009","journal-title":"Journal of Southwest University for Nationalities."},{"key":"ref10","first-page":"93","article-title":"Smoothing methods for solving general nonlinear complementarity problems","volume":"12","author":"Chen","year":"2008","journal-title":"J. Or Transactions."},{"key":"ref11","first-page":"20","article-title":"The smooth trust region algorithm for nonlinear complementarity problems","volume":"23","author":"Ma","year":"2006","journal-title":"J. Chinese Journal of Engineering Mathematics."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-004-5026-x"},{"key":"ref13","first-page":"207","article-title":"A line search algorithm with memory for unconstrained optimization","volume":"3","author":"Gould","year":"1998","journal-title":"J. Kluwer Academic Publishers."},{"key":"ref14","first-page":"89","article-title":"Convergence analysis and parameter selection in particle swarm optimization","volume":"23","author":"Cui","year":"2007","journal-title":"J. Computer Engineering and Applications."},{"key":"ref15","article-title":"Completely mooth trust region algorithm for nonlinear complementarity problem","author":"Wang","journal-title":"J. Journal of Southwest University for Nationalities."},{"key":"ref16","first-page":"558","article-title":"Trust region algorithm for a class of nonlinear complementarity problem","volume":"22","author":"Ou","year":"2004","journal-title":"J. Math. China"}],"container-title":["Journal of Computers"],"original-title":[],"deposited":{"date-parts":[[2015,9,15]],"date-time":"2015-09-15T15:08:57Z","timestamp":1442329737000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jcp\/article\/view\/3929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,1]]},"references-count":16,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2011,8,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jcp.6.8.1562-1569","relation":{},"ISSN":["1796-203X"],"issn-type":[{"value":"1796-203X","type":"print"}],"subject":[],"published":{"date-parts":[[2011,8,1]]}}}