{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T12:47:55Z","timestamp":1771505275868,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1023\/a:1026400522929","type":"journal-article","created":{"date-parts":[[2003,11,6]],"date-time":"2003-11-06T11:45:40Z","timestamp":1068119140000},"page":"309-330","source":"Crossref","is-referenced-by-count":23,"title":["Primal-Dual Path-Following Algorithms for Determinant Maximization Problems With Linear Matrix Inequalities"],"prefix":"10.1007","volume":"14","author":[{"given":"Kim-Chuan","family":"Toh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"235042_CR1","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1137\/S1052623496304700","volume":"8","author":"F. Alizadeh","year":"1998","unstructured":"F. Alizadeh, J.-P.A. Haeberly, and M. Overton, \u201cPrimal-dual interior-point methods for semidefinite programming: Convergence results, stability and numerical results,\u201d SIAM J. Optimization, vol. 8, pp. 746-768, 1998.","journal-title":"SIAM J. Optimization"},{"key":"235042_CR2","first-page":"111","volume":"77","author":"F. Alizadeh","year":"1997","unstructured":"F. Alizadeh, J.-P.A. Haeberly, and M. Overton, \u201cComplementarity and nondegeneracy in semidefinite programming,\u201d Math. Programming, vol. 77, pp. 111-128, 1997.","journal-title":"Math. Programming"},{"key":"235042_CR3","series-title":"Studies in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970777","volume-title":"Linear matrix inequalities in system and control theory","author":"S. Boyd","year":"1994","unstructured":"S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, \u201cLinear matrix inequalities in system and control theory,\u201d vol. 15 of Studies in Applied Mathematics, SIAM, Philadelphia, PA, 1994."},{"key":"235042_CR4","first-page":"235","volume":"79","author":"K. Fujisawa","year":"1997","unstructured":"K. Fujisawa, M. Kojima, and K. Nakata, \u201cExploiting sparsity in primal-dual interior-point methods for semidefinite programming,\u201d Mathematical Programming, vol. 79, pp. 235-253, 1997.","journal-title":"Mathematical Programming"},{"key":"235042_CR5","unstructured":"K. Fujisawa, M. Kojima, and K. Nakata, \u201cSDPA (semidefinite programming algorithm)\u2014User's manual,\u201d Research Report, Department of Mathematical and Computing Science, Tokyo Institute of Technology, Tokyo."},{"key":"235042_CR6","unstructured":"D. Goldfarb and K. Scheinberg, \u201cInterior point trajectories in semidefinite programming,\u201d manuscript, 1996."},{"key":"235042_CR7","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C. Helmberg","year":"1996","unstructured":"C. Helmberg, F. Rendl, R. Vanderbei, and H. Wolkowicz, \u201cAn interior-point method for semidefinite programming,\u201d SIAM J. Optimization, vol. 6, pp. 342-361, 1996.","journal-title":"SIAM J. Optimization"},{"key":"235042_CR8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/S1052623494269035","volume":"7","author":"M. Kojima","year":"1997","unstructured":"M. Kojima, S. Shindoh, and S. Hara, \u201cInterior-point methods for the monotone linear complementarity problem in symmetric matrices,\u201d SIAM J. Optimization, vol. 7, pp. 86-125, 1997.","journal-title":"SIAM J. Optimization"},{"key":"235042_CR9","unstructured":"C.-J. Lin and R. Saigal, \u201cAn infeasible start predictor-corrector method for semi-definite linear programming,\u201d manuscript, Department of Industrial and Operations Engineering, University of Michigan, December, 1995."},{"key":"235042_CR10","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"R.D.C. Monteiro","year":"1997","unstructured":"R.D.C. Monteiro, \u201cPrimal-dual path following algorithms for semidefinite programming,\u201d SIAM J. Optimization, vol. 7, pp. 663-678, 1997.","journal-title":"SIAM J. Optimization"},{"key":"235042_CR11","first-page":"281","volume":"81","author":"R.D.C. Monteiro","year":"1998","unstructured":"R.D.C. Monteiro and Y. Zhang, \u201cA unified analysis of path-following primal-dual interior-point algorithms for semidefinite programming,\u201d Mathematical Programming, vol. 81, pp. 281-299, 1998.","journal-title":"Mathematical Programming"},{"key":"235042_CR12","series-title":"Studies in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y. Nesterov","year":"1994","unstructured":"Y. Nesterov and A. Nemirovsky, \u201cInterior-Point Polynomial Algorithms in Convex Programming,\u201d vol. 13 of Studies in Applied Mathematics, SIAM: Philadelphia, PA, 1994."},{"key":"235042_CR13","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"Y. Nesterov","year":"1998","unstructured":"Y. Nesterov and M.J. Todd, \u201cPrimal-dual interior-point methods for self-scaled cones,\u201d SIAM J. Optimization, vol. 8, pp. 324-364, 1998.","journal-title":"SIAM J. Optimization"},{"key":"235042_CR14","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y. Saad","year":"1996","unstructured":"Y. Saad, \u201cIterative Methods for Sparse Linear Systems,\u201d PWS Publishing Company: Boston, MA, 1996."},{"key":"235042_CR15","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1137\/S105262349630060X","volume":"8","author":"M.J. Todd","year":"1998","unstructured":"M.J. Todd, K.C. Toh, and R.H. T\u00fct\u00fcnc\u00fc, \u201cOn the Nesterov-Todd direction in semidefinite programming,\u201d SIAM J. Optimization vol. 8, pp. 769-796, 1998.","journal-title":"SIAM J. Optimization"},{"key":"235042_CR16","series-title":"Technical Report","volume-title":"Search directions for primal-dual interior point methods in semidefinite programming","author":"K.C. Toh","year":"1997","unstructured":"K.C. Toh, \u201cSearch directions for primal-dual interior point methods in semidefinite programming,\u201d Technical Report 722, Department of Mathematics, National University of Singapore, Singapore, July, 1997. Revised in March 1998."},{"key":"235042_CR17","unstructured":"K.C. Toh, \u201cA note on the condition number of the Jacobian associated with the AHO direction for solving maxdet-problem,\u201d manuscript in preparation."},{"key":"235042_CR18","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"L. Vandenberghe and S. Boyd, \u201cSemidefinite programming,\u201d SIAM Review, vol. 38, pp. 49-95, 1996.","journal-title":"SIAM Review"},{"key":"235042_CR19","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/S0895479896303430","volume":"19","author":"L. Vandenberghe","year":"1998","unstructured":"L. Vandenberghe, S. Boyd, and S.-P. Wu, \u201cDeterminant maximization with linear matrix inequality equalities,\u201d SIAM J. Matrix Analysis and Applications, vol. 19, pp. 499-533, 1998.","journal-title":"SIAM J. Matrix Analysis and Applications"},{"key":"235042_CR20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1137\/S1052623495296115","volume":"8","author":"Y. Zhang","year":"1998","unstructured":"Y. Zhang, \u201cOn extending some primal-dual interior-point algorithms from linear programming to semidefinite programming,\u201d SIAM J. Optimization, vol. 8, pp. 365-386, 1998.","journal-title":"SIAM J. Optimization"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026400522929.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026400522929\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026400522929.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:37:36Z","timestamp":1752377856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026400522929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["235042"],"URL":"https:\/\/doi.org\/10.1023\/a:1026400522929","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}