{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T12:12:45Z","timestamp":1648642365260},"reference-count":18,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:p> We present a full-Newton step infeasible interior-point algorithm based on a new search direction. The algorithm decreases the duality gap and the feasibility residuals at the same rate. During this algorithm we construct strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem. Each main iteration of the algorithm consists of a feasibility step and some centering steps. We show that the algorithm converges and finds an approximate solution in a polynomial time complexity. A numerical study is done for its numerical performance. <\/jats:p>","DOI":"10.1142\/s0217595913500279","type":"journal-article","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T02:41:57Z","timestamp":1384224117000},"page":"1350027","source":"Crossref","is-referenced-by-count":1,"title":["A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION"],"prefix":"10.1142","volume":"30","author":[{"given":"B.","family":"KHEIRFAM","sequence":"first","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"AHMADI","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"HASANI","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,12,19]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403423114"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-009-9634-0"},{"key":"rf3","volume-title":"Nonlinear and Dynamic Programming","author":"Hadley G.","year":"1970"},{"key":"rf4","first-page":"375","volume":"4","author":"Karmarkar N. K.","journal-title":"Combinatorica"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582151"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/s00245-009-9069-x"},{"key":"rf7","first-page":"145","volume":"67","author":"Lustig I. J.","journal-title":"Mathematical Programming"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582216"},{"key":"rf9","unstructured":"M. J. D.\u00a0Powell, Nonlinear Programming, eds. J.\u00a0Rosen, O.\u00a0Mangasarian and K.\u00a0Ritter (Academic Press, New York, 1970)\u00a0pp. 291\u2013312."},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1137\/050623917"},{"key":"rf11","volume-title":"Theory and Algorithms for Linear Optimization. An Interior-Point Approach","author":"Roos C.","year":"1997"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/BF00932552"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.1.53"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1137\/0804012"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2011.06.006"},{"key":"rf18","first-page":"2029","volume":"6","author":"Zhang L.","journal-title":"Journal of Software"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595913500279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:29:17Z","timestamp":1565137757000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595913500279"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":18,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2013,12,19]]},"published-print":{"date-parts":[[2013,12]]}},"alternative-id":["10.1142\/S0217595913500279"],"URL":"https:\/\/doi.org\/10.1142\/s0217595913500279","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}