{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:12:09Z","timestamp":1777644729119,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T00:00:00Z","timestamp":1489622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2017,3,16]]},"abstract":"<jats:p>\n                    In this paper, we propose a predictor-corrector infeasible interior-point algorithm for semidefinite optimization based on the Nesterov-Todd scaling scheme. In each iteration, the algorithm computes the new iterate using a new combination of the predictor and corrector directions. Using the Ai-Zhang\u2019s wide neighborhood for linear complementarity problems, and extended to semidefinite optimization by Li and Terlaky, it is shown that the iteration complexity bound of the algorithm is\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" overflow=\"scroll\" altimg=\"eq-00001.gif\">\n                      <mml:mrow>\n                        <mml:mi>\ud835\udcaa<\/mml:mi>\n                        <mml:mrow>\n                          <mml:mo>(<\/mml:mo>\n                          <mml:mrow>\n                            <mml:msup>\n                              <mml:mi>n<\/mml:mi>\n                              <mml:mrow>\n                                <mml:mfrac>\n                                  <mml:mn>5<\/mml:mn>\n                                  <mml:mn>4<\/mml:mn>\n                                <\/mml:mfrac>\n                              <\/mml:mrow>\n                            <\/mml:msup>\n                            <mml:mi>log<\/mml:mi>\n                            <mml:msup>\n                              <mml:mi>\u03b5<\/mml:mi>\n                              <mml:mrow>\n                                <mml:mo>\u2212<\/mml:mo>\n                                <mml:mn>1<\/mml:mn>\n                              <\/mml:mrow>\n                            <\/mml:msup>\n                          <\/mml:mrow>\n                          <mml:mo>)<\/mml:mo>\n                        <\/mml:mrow>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    , where n is the dimension of the problem and \u025b is the required precision.\n                  <\/jats:p>","DOI":"10.3233\/fi-2017-1511","type":"journal-article","created":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T10:44:49Z","timestamp":1489747489000},"page":"33-50","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":8,"title":["A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood"],"prefix":"10.1177","volume":"152","author":[{"given":"Behrouz","family":"Kheirfam","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, Azarbaijan Shahid Madani University, Tabriz, I.R. Iran."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2017,3,16]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2017-1511","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2017-1511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:30:13Z","timestamp":1777444213000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2017-1511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,16]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3,16]]}},"alternative-id":["10.3233\/FI-2017-1511"],"URL":"https:\/\/doi.org\/10.3233\/fi-2017-1511","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,16]]}}}