{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:34:30Z","timestamp":1787333670484,"version":"build-2736575974"},"reference-count":21,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[1998,5]]},"abstract":"<jats:p>Various search directions used in interior-point algorithms for the semidefinite program (SDP) and the monotone semidefinite linear complementarity problem (SDLCP) are characterized by the intersection of a maximal monotone affine subspace and a maximal and strictly antitone affine subspace. This observation provides a unified geometric view over the existence of those search directions.<\/jats:p>","DOI":"10.1137\/s1052623496300611","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"387-396","source":"Crossref","is-referenced-by-count":24,"title":["Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP"],"prefix":"10.1137","volume":"8","author":[{"given":"Masayuki","family":"Shida","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Susumu","family":"Shindoh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Masakazu","family":"Kojima","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"F. Alizadeh,\n                      Interior point methods in semidefinite programming with applications to combinatorial optimization\n                      , SIAM Journal on Optimization, Vol. 5, No. 1, (1995), pp. 13\u201351.","DOI":"10.1137\/0805002"},{"key":"R2","first-page":"1","volume":"11","author":"Todd M.","year":"1999","journal-title":"Optim. Methods Softw."},{"key":"R3","volume-title":"Applied nonlinear analysis","author":"Sequeira Ad\u00e9lia","year":"1999"},{"key":"R4","unstructured":"AlexanderGraham, Kronecker products and matrix calculus: with applications, Ellis Horwood Ltd., 1981, 130\u20130, Ellis Horwood Series in Mathematics and its Applications83g:15001"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1287\/moor.20.2.441"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1137\/0806020"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"S. Karamardian,\n                      Complementarity problems over cones with monotone and pseudomonotone maps\n                      , Journal of Optimization Theory and Applications Vol. 18, No. 4, (1976), pp. 445\u2013454.","DOI":"10.1007\/BF00932654"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54509-3"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01587074"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"MasakazuKojima, ShinjiMizuno, AkikoYoshise, A primal\u2010dual interior point algorithm for linear programming, Springer, New York, 1989, 29\u20134790k:90093","DOI":"10.1007\/978-1-4613-9617-8_2"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496300623"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494269035"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-62-02933-2"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496312836"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Y. Nesterov and A. Nemirovskii,\n                      Interior\u2010Point Polynomial Algorithms in Convex Programming\n                      , SIAM, Philadelphia, 1994.","DOI":"10.1137\/1.9781611970791"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495290209"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1287\/moor.22.4.969"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"K. Tanabe,\n                      Centered Newton methods for mathematical programming\n                      , in System Modeling and Optimization, M. Iri and K. Yajima, eds., Springer\u2010Verlag, New York, 1988, pp. 197\u2013206.","DOI":"10.1007\/BFb0042787"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1137\/S105262349630060X"},{"key":"R20","unstructured":"T. Tsuchiya,\n                      A new family of polynomial\u2010time interior point algorithms for linear proramming\n                      , tech. report, The Institute of Statistical Mathematics, Minato\u2010ku, Tokyo, Japan, 1994."},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5610(94)00062-X"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S1052623496300611","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:17:09Z","timestamp":1787332629000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S1052623496300611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["10.1137\/S1052623496300611"],"URL":"https:\/\/doi.org\/10.1137\/s1052623496300611","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}