{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T22:34:20Z","timestamp":1772750060197,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1007\/bf01585558","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:42:17Z","timestamp":1114663337000},"page":"205-236","source":"Crossref","is-referenced-by-count":111,"title":["A primal\u2014dual potential reduction method for problems involving matrix inequalities"],"prefix":"10.1007","volume":"69","author":[{"given":"Lieven","family":"Vandenberghe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Boyd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I. Adler","year":"1989","unstructured":"I. Adler, M.G.C. Resende, G. Veiga and N. Karmarkar, \u201cAn implementation of Karmarkar's algorithm for linear programming,\u201dMathematical Programming 44 (1989) 297\u2013335.","journal-title":"Mathematical Programming"},{"key":"CR2","unstructured":"F. Alizadeh, \u201cCombinatorial optimization with interior point methods and semi-definite matrices,\u201d Ph.D. Thesis, Univ. Minnesota, 1991."},{"key":"CR3","volume-title":"Advances in Optimization and Parallel Computing","author":"F. Alizadeh","year":"1992","unstructured":"F. Alizadeh, \u201cOptimization over the positive-definite cone: interior point methods and combinatorial applications,\u201d in: P. Pardalos, ed.,Advances in Optimization and Parallel Computing (North-Holland, Amsterdam, 1992)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF01582899","volume":"52","author":"K.M. Anstreicher","year":"1991","unstructured":"K.M. Anstreicher, \u201cA combined phase I-phase II scaled potential algorithm for linear programming,\u201dMathematical Programming 52 (1991) 429\u2013439.","journal-title":"Mathematical Programming"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"1746","DOI":"10.1109\/PROC.1984.13083","volume":"72","author":"W.F. Arnold","year":"1984","unstructured":"W.F. Arnold and A.J. Laub, \u201cGeneralized eigenproblem algorithms and software for algebraic Riccati equations,\u201dProceedings of the IEEE 72 (1984) 1746\u20131754.","journal-title":"Proceedings of the IEEE"},{"key":"CR6","first-page":"1","volume-title":"Convexity, Proceedings of Symposia in Pure Mathematics 7","author":"R. Bellman","year":"1963","unstructured":"R. Bellman and K. Fan, \u201cOn systems of linear inequalities in Hermitian matrix variables,\u201d in: V.L. Klee, ed.,Convexity, Proceedings of Symposia in Pure Mathematics 7 (American Mathematical Society, Providence, RI, 1963) 1\u201311."},{"key":"CR7","unstructured":"A. Ben Tal and A. Nemirovskii, \u201cInterior point polynomial time methods for truss topology design,\u201d Technical Report 3\/92, Faculty of Industrial Engineering and Management, Technion, Israel Institute of Technology, 1992."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0024-3795(93)90465-Z","volume":"188","author":"S. Boyd","year":"1993","unstructured":"S. Boyd and L. El Ghaoui, \u201cMethod of centers for minimizing generalized eigenvalues,\u201dLinear Algebra and Applications 188 (1993) 63\u2013111 (special issue on Numerical Linear Algebra Methods in Control, Signals and Systems).","journal-title":"Linear Algebra and Applications"},{"key":"CR9","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,Linear Matrix Inequalities in System and Control Theory, Studies in Applied Mathematics 15 (SIAM, Philadelphia, PA, 1994)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/0802005","volume":"2","author":"D. Hertog Den","year":"1992","unstructured":"D. Den Hertog, C. Roos and T. Terlaky, \u201cA large-step analytic center method for a class of smooth convex programming problems,\u201dSIAM Journal on Optimization 2 (1992) 55\u201370.","journal-title":"SIAM Journal on Optimization"},{"key":"CR11","first-page":"674","volume":"8","author":"I. Dikin","year":"1967","unstructured":"I. Dikin, \u201cIterative solution of problems of linear and quadratic programming\u201d,Soviet Mathematics Doklady 8 (1967) 674\u2013675.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0902021","volume":"2","author":"R. Fletcher","year":"1981","unstructured":"R. Fletcher, \u201cA nonlinear programming problem in statistics (educational testing),\u201dSIAM Journal on Scientific and Statistical Computing 2 (1981) 257\u2013267.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0323032","volume":"23","author":"R. Fletcher","year":"1985","unstructured":"R. Fletcher, \u201cSemidefinite matrix constraints in optimization,\u201dSIAM Journal on Control and Optimization 23 (1985) 493\u2013513.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF01582900","volume":"52","author":"R.M. Freund","year":"1991","unstructured":"R.M. Freund, \u201cA potential-function reduction algorithm for solving a linear program directly from an infeasible warm start,\u201dMathematical Programming 52 (1991) 441\u2013466.","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/146847.146929","volume":"18","author":"J.D. Gardiner","year":"1992","unstructured":"J.D. Gardiner, A.J. Laub, J.J. Amato and C.B. Moler, \u201cSolution of the Sylvester matrix equationAXB T+CXD T=E,\u201dACM Transactions on Mathematical Software 18 (1992) 223\u2013231.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright, \u201cOn projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method,\u201dMathematical Programming Studies 36 (1986) 183\u2013209.","journal-title":"Mathematical Programming Studies"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01580737","volume":"40","author":"D. Goldfarb","year":"1988","unstructured":"D. Goldfarb and S. Mehrotra, \u201cA relaxed version of Karmarkar's method,\u201dMathematical Programming 40 (1988) 289\u2013315.","journal-title":"Mathematical Programming"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1137\/0726056","volume":"26","author":"D. Goldfarb","year":"1989","unstructured":"D. Goldfarb and S. Mehrotra, \u201cA self-correcting version of Karmarkar's algorithm,\u201dSIAM Journal on Numerical Analysis 26 (1989) 1006\u20131015.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR19","volume-title":"Matrix Computations","author":"G. Golub","year":"1989","unstructured":"G. Golub and C. Van Loan,Matrix Computations (Johns Hopkins Univ. Press, Baltimore, MD, 1989)."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1109\/TAC.1979.1102170","volume":"24","author":"G. Golub","year":"1979","unstructured":"G. Golub, S. Nash and C. Van Loan, \u201cA Hessenberg-Schur method for the matrix problemAX+XB=C,\u201dIEEE Transactions on Automatic Control 24 (1979) 909\u2013913.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C.C. Gonzaga","year":"1992","unstructured":"C.C. Gonzaga, \u201cPath-following methods for linear programming,\u201dSIAM Review 34 (1992) 167\u2013224.","journal-title":"SIAM Review"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/0802017","volume":"2","author":"C.C. Gonzaga","year":"1992","unstructured":"C.C. Gonzaga and M.J. Todd, \u201cAn $$O(\\sqrt n L)$$ -iteration large-step primal-dual affine algorithm for linear programming,\u201dSIAM Journal on Optimization 2 (1992) 349\u2013359.","journal-title":"SIAM Journal on Optimization"},{"key":"CR23","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver,Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics 2 (Springer, Berlin, 1988)."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1137\/0331064","volume":"31","author":"F. Jarre","year":"1993","unstructured":"F. Jarre, \u201cAn interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices,\u201dSIAM Journal on Control and Optimization 31 (1993) 1360\u20131377.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR25","unstructured":"K. Kim and J.L. Nazareth, \u201cImplementation of a primal null-space affine scaling method and its extensions,\u201d Technical Report, Department of Pure and Applied Mathematics, Washington State Univ., 1992."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"I.J. Lustig","year":"1991","unstructured":"I.J. Lustig, \u201cFeasibility issues in a primal-dual interior-point method for linear programming,\u201dMathematical Programming 49 (1991) 145\u2013162.","journal-title":"Mathematical Programming"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/ijoc.4.2.103","volume":"4","author":"S. Mehrotra","year":"1992","unstructured":"S. Mehrotra, \u201cImplementations of affine scaling methods: approximate solutions of systems of linear equations using preconditioned conjugate gradient methods,\u201dORSA Journal on Computing 4 (1992) 103\u2013118.","journal-title":"ORSA Journal on Computing"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, \u201cInterior path-following primal-dual algorithms. Part II; Convex quadratic programming,\u201dMathematical Programming 44 (1989) 43\u201366.","journal-title":"Mathematical Programming"},{"key":"CR29","volume-title":"Optimization over Positive Semidefinite Matrices: Mathematical Background and User's Manual","author":"Yu. Nesterov","year":"1990","unstructured":"Yu. Nesterov and A. Nemirovsky,Optimization over Positive Semidefinite Matrices: Mathematical Background and User's Manual (USSR Acad. Sci. Center. Econ. & Math. Inst., Moscow, 1990)."},{"key":"CR30","series-title":"Studies in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point Polynomial Methods in Convex Programming","author":"Yu. Nesterov","year":"1994","unstructured":"Yu. Nesterov and A. Nemirovsky,Interior-point Polynomial Methods in Convex Programming, Studies in Applied Mathematics 13 (SIAM, Philadelphia, PA, 1994)."},{"key":"CR31","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0609021","volume":"9","author":"M. Overton","year":"1988","unstructured":"M. Overton, \u201cOn minimizing the maximum eigenvalue of a symmetric matrix,\u201dSIAM Journal on Matrix Analysis and Applications 9 (1988) 256\u2013268.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0802007","volume":"2","author":"M. Overton","year":"1992","unstructured":"M. Overton, \u201cLarge-scale optimization of eigenvalues,\u201dSIAM Journal on Optimization 2 (1992) 88\u2013120.","journal-title":"SIAM Journal on Optimization"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/355984.355989","volume":"8","author":"C.C. Paige","year":"1982","unstructured":"C.C. Paige and M.S. Saunders, \u201cLSQR: An algorithm for sparse linear equations and sparse least squares,\u201dACM Transactions on Mathematical Software 8 (1982) 43\u201371.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR34","unstructured":"J.-P. Vial, \u201cComputational experience with a primal-dual interior-point method for smooth convex programming,\u201d Technical Report, D\u00e9partement d'\u00c9conomie Commerciale et Industrielle, Univ. Gen\u00e8ve, 1992."},{"key":"CR35","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1137\/0613062","volume":"13","author":"G.A. Watson","year":"1992","unstructured":"G.A. Watson, \u201cAlgorithms for minimum trace factor analysis,\u201dSIAM Journal on Matrix Analysis and Applications 13 (1992) 1039\u20131053.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"CR36","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","volume":"50","author":"Y. Ye","year":"1991","unstructured":"Y. Ye, \u201cAn O(n 3L) potential reduction algorithm for linear programming,\u201dMathematical Programming 50 (1991) 239\u2013258.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585558.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585558\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585558","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:32:28Z","timestamp":1556883148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585558"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":36,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["BF01585558"],"URL":"https:\/\/doi.org\/10.1007\/bf01585558","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}