{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T06:19:37Z","timestamp":1780985977086,"version":"3.54.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","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":["J Glob Optim"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1007\/bf01100204","type":"journal-article","created":{"date-parts":[[2005,2,5]],"date-time":"2005-02-05T11:03:01Z","timestamp":1107601381000},"page":"33-50","source":"Crossref","is-referenced-by-count":120,"title":["Some geometric results in semidefinite programming"],"prefix":"10.1007","volume":"7","author":[{"given":"Motakuri","family":"Ramana","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. J.","family":"Goldman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Ph.D. Thesis","author":"F. Alizadeh","year":"1991","unstructured":"F. Alizadeh (1991), Combinatorial Optimization with Interior Point Methods and Semi-Definite Matrices, Ph.D. Thesis, Computer Science Department, University of Minnesota, Minneapolis, Minnesota, 1991."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"F. Alizadeh (1995), Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization,SIAM J. Optimization 5, No. 1.","DOI":"10.1137\/0805002"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.2140\/pjm.1975.57.15","volume":"57","author":"G. P. Barker","year":"1975","unstructured":"G. P. Barker and D. Carlson (1975), Cones of Diagonally Dominant Matrices,Pac. J. Math. 57, 15?31.","journal-title":"Pac. J. Math."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/0611037","volume":"11","author":"P. Binding","year":"1990","unstructured":"P. Binding (1990), Simultaneous Diagonalization of Several Hermitian Matrices,SIAM J. Matrix Anal Appl. 11, 531?536.","journal-title":"SIAM J. Matrix Anal Appl."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0024-3795(91)90361-Y","volume":"151","author":"P. Binding","year":"1991","unstructured":"P. Binding and C.-K. Li (1991), Joint Ranges of Hermitian Matrices and Simultaneous Diagonalization,Linear Algebra Appl. 151, 157?167.","journal-title":"Linear Algebra Appl."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1090\/S0002-9904-1969-12153-1","volume":"75","author":"A. Ben-Israel","year":"1969","unstructured":"A. Ben-Israel, A. Charnes, and K. Kortanek, (1969) Duality and Asymptotic Solvability over Cones,Bull. of AMS 75, 318?324.","journal-title":"Bull. of AMS"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"A. Berman (1973),Cone, Matrices, and Mathematical Programming; Lecture Notes in Economics and Mathematical Systems, Springer.","DOI":"10.1007\/978-3-642-80730-5"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1017\/S1446788700017882","volume":"30","author":"J. Borwein","year":"1981","unstructured":"J. Borwein and H. Wolkowicz (1981), Characterization of Optimality for the Abstract Convex Program with Finite Dimensional Range,J. Austral. Math. Soc., Series A30, 390?411.","journal-title":"J. Austral. Math. Soc., Series A"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BFb0120698","volume":"3","author":"J. Cullum","year":"1975","unstructured":"J. Cullum, W. E. Donath, and P. Wolfe (1975), The Minimization of Certain Nondifferentiable Sums of Eigenvalue Problems,Math. Prog. Study 3, 35?55.","journal-title":"Math. Prog. Study"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1006\/eujc.1993.1035","volume":"14","author":"C. Delorme","year":"1993","unstructured":"C. Delorme and S. Poljak (1993), Combinatorial Properties and the Complexity of a Max-Cut Approximation,Europ. J. Combinatorics 14, 313?333.","journal-title":"Europ. J. Combinatorics"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0323032","volume":"23","author":"R. Fletcher","year":"1985","unstructured":"R. Fletcher (1985), Semi-Definite Matrix Constraints in Optimization,SIAM J. Control and Optimization 23, 493?513.","journal-title":"SIAM J. Control and Optimization"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"M. X. Goemans and D. P. Williamson (1995), Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming,Submitted to J. ACM. (contact goemans@math.mit.edu for copies)","DOI":"10.1145\/227683.227684"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0024-3795(90)90006-X","volume":"134","author":"R. Grone","year":"1990","unstructured":"R. Grone, S. Pierce, and W. Watkins (1990), Extremal Correlation Matrices,Linear Algebra and its Applications 134, pp. 63?70.","journal-title":"Linear Algebra and its Applications"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sza, and A. Schrijver (1984), Polynomial Algorithms for Perfect Graphs,Annals of Discrete Mathematics 21, C. Berge and V. Chv\u00e1tal, eds., North Holland.","DOI":"10.1016\/S0304-0208(08)72943-8"},{"key":"CR15","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 (1988),Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin."},{"key":"CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R. Horn","year":"1985","unstructured":"R. Horn and C.R. Johnson,Matrix Analysis, Cambridge University Press, Cambridge, 1985."},{"key":"CR17","volume-title":"Research Reports on Information Sciences","author":"M. Kojima","year":"1994","unstructured":"M. Kojima, S. Kojima, and S. Hara, Linear Algebra for Semidefinite Programming, TR B-290, Research Reports on Information Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1994."},{"key":"CR18","volume-title":"Technical Report, LIENS-93-27","author":"M. Laurent","year":"1993","unstructured":"M. Laurent and S. Poljak, On a Positive Semideflnite Relaxation of the Cut Polytope, Technical Report, LIENS-93-27, Ecole Normale Sup\u00e9rieure, France, 1993. (Contact monique@cwi.nl for copies)"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz and A. Schrijver, Cones of Matrices and Setfunctions, and 0?1 Optimization,SIAM J. Optimization 1 (1991).","DOI":"10.1137\/0801013"},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"Y. Nesterov and A. Nemirovskii,Interior Point Polynomial Methods for Convex Programming: Theory and Applications, SIAM, 1994.","DOI":"10.1137\/1.9781611970791"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0802007","volume":"2","author":"M. L. Overton","year":"1992","unstructured":"M. L. Overton, Large-Scale Optimization of Eigenvalues,SIAM J. Optimization 2 (1992), pp. 88?120.","journal-title":"SIAM J. Optimization"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01585173","volume":"62","author":"M. L. Overton","year":"1993","unstructured":"M. L. Overton and R. S. Womersley, Optimality Conditions and Duality Theory for Minimizing Sums of the Largest Eigenvalues of Symmetric Matrices,Math. Prog., Series B62 (1993), pp. 321?357.","journal-title":"Math. Prog., Series B"},{"issue":"2","key":"CR23","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01581088","volume":"57","author":"P. M. Pardalos","year":"1992","unstructured":"P. M. Pardalos and S. A. Vavasis (1992), Open Questions in Complexity Theory for Numerical Optimization,Math. Prog. 57(2), 337?339.","journal-title":"Math. Prog."},{"key":"CR24","volume-title":"Technical Report","author":"G. Pataki","year":"1993","unstructured":"G. Pataki, Algorithms for Linear Programs over Cones and Semidefinite Programming, Technical Report, GSIA, Carnegie-Mellon University, Pittsburgh, 1993. (contact gabor@magrathea.gsia.cmu.edu for copies)"},{"key":"CR25","volume-title":"Management Science Research Report # MSRR-595, GSIA","author":"G. Pataki","year":"1994","unstructured":"G. Pataki, On the Facial Structure of Cone-LP's and Semidefinite Programs, Management Science Research Report # MSRR-595, GSIA, Carnegie-Mellon University, Pittsburgh, 1994."},{"key":"CR26","unstructured":"M. Ramana (1995), An Exact Duality Theory for Semidefinite Programming and its Complexity Implications, DIMACS TR 95-02R (http:\/\/www.dimacs.edu), Rutgers University; Submitted toMath Programming."},{"key":"CR27","first-page":"1993","volume-title":"Ph.D. Thesis","author":"M. V. Ramana","year":"1993","unstructured":"M. V. Ramana (1993), An algorithmic analysis of multiquadratic and Semidefinite programming problems, Ph.D. Thesis, The Johns Hopkins University, Baltimore, 1993."},{"key":"CR28","unstructured":"M. V. Ramana and A. J. Goldman, Cutting Plane Techniques for Multiquadratic Programming, Under Preparation."},{"key":"CR29","unstructured":"M. V. Ramana and A. J. Goldman, Quadratic Maps with Convex Images, Submitted to Math of OR."},{"key":"CR30","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"T. R. Rockafellar","year":"1970","unstructured":"T. R. Rockafellar,Convex Analysis, Princeton University Press, Princeton, 1970."},{"key":"CR31","unstructured":"L. Vandenberghe and S. Boyd (1994), Positive-Definite Programming,Mathematical Programming: State of the Art 1994, J. R. Birge and K. G. Murty (eds.), U. of Michigan."},{"key":"CR32","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0024-3795(81)90143-9","volume":"40","author":"H. Wolkowicz","year":"1981","unstructured":"H. Wolkowicz, Some Applications of Optimization in Matrix Theory,Linear Algebra and its Applications 40 (1981), 101?118.","journal-title":"Linear Algebra and its Applications"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01100204.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01100204\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01100204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T16:07:13Z","timestamp":1586102833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01100204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["BF01100204"],"URL":"https:\/\/doi.org\/10.1007\/bf01100204","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}