{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T08:24:43Z","timestamp":1751876683480},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1007\/bf01299152","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T02:18:11Z","timestamp":1111717091000},"page":"107-127","source":"Crossref","is-referenced-by-count":3,"title":["A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix"],"prefix":"10.1007","volume":"2","author":[{"given":"Batool","family":"Nekooie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael K. H.","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"M. Akgul, ?Topics in relaxation and ellipsoidal methods,? Research Notes in Mathematics, Pitman, 1984."},{"key":"CR2","unstructured":"F. Alizadeh, ?Combinatorial optimization with semidefinite matrices,? Proc. of Second Annual Integer Programming and Combinatorial Optimization Conf., Carnegie-Mellon University, 1991."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"E.R. Barnes, ?An algorithm for partitioning the nodes of a graph,?SIAM J. Alg. and Disc. Math. 3, (1982).","DOI":"10.1137\/0603056"},{"key":"CR4","series-title":"Progress in Combinatorial Optimization","volume-title":"Partitioning, spectra, and linear programming","author":"A.E. Barnes","year":"1984","unstructured":"A.E. Barnes, and A.J. Hoffman, ?Partitioning, spectra, and linear programming,?Progress in Combinatorial Optimization, Academic Press: New York, NY, 1984."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"J.A. Bondy, and U.S.R. Murty,Graph Theory with Applications, American Elsevier, 1976.","DOI":"10.1007\/978-1-349-03521-2"},{"key":"CR6","volume-title":"Optimization and Nonsmooth Analysis","author":"F.H. Clarke","year":"1983","unstructured":"F.H. Clarke,Optimization and Nonsmooth Analysis, J. Wiley & Sons: New York, NY, 1983."},{"key":"CR7","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, ?The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices,?Math. Prog. Study 3, (1975), 35?55.","journal-title":"Math. Prog. Study"},{"key":"CR8","unstructured":"W.E. Donath, and A.J. Hoffman, ?Algorithms for partitioning graphs and computer logic based on eigenvectors of connection matrices,?IBM Tech. Disclosures Bul. 15, (1972)."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"W.E. Donath, and A.J. Hoffman, ?Lower bounds for the partitioning of graphs,?IBM J. Res. Dev.,17, (1973).","DOI":"10.1147\/rd.175.0420"},{"issue":"6","key":"CR10","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1049\/ip-d.1982.0053","volume":"129","author":"J.C. Doyle","year":"1982","unstructured":"J.C. Doyle, ?Analysis of feedback systems with structured uncertainties,?Proc. IEE-D 129, 6, (1982), 242?250.","journal-title":"Proc. IEE-D"},{"key":"CR11","unstructured":"M.K.H. Fan, ?An algorithm to compute the structured singular value,? Technical report, SRC TR-86-8, Systems Research Center, University of Maryland, 1986."},{"key":"CR12","unstructured":"M.K.H. Fan, ?A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix,?Linear Algebra and Its Applications on Numerical Linear Algebra Methods in Control, Signals and Systems, to appear."},{"key":"CR13","unstructured":"M.K.H. Fan, and B. Nekooie, ?On minimizing the largest eigenvalue of a symmetric matrix,?Linear Algebra and Its Applications, to appear."},{"key":"CR14","unstructured":"J.E. Hauser, ?Proximity algorithms: Theory and implementation,? Electronics Research Laboratory, University of California, Memo No. UCB\/ERL M86\/53, Berkeley, California, May 1986."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"R.A. Horn, and C.R. Johnson,Matrix Analysis, Cambridge University Press, 1985.","DOI":"10.1017\/CBO9780511810817"},{"issue":"2","key":"CR16","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"J.E. Kelley, ?The cutting-plane method for solving convex programs,?J. Soc. Indust. Appl. Math. 8, 2, (1960), 703?712.","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"CR17","volume-title":"PRO-MATLAB User's Guide","author":"C. Moler","year":"1987","unstructured":"C. Moler, J. Little, and S. Bangert,PRO-MATLAB User's Guide, The Math Works, Inc., Sherborn, MA, 1987."},{"key":"CR18","unstructured":"G. Narasimhan, and R. Manber, ?A generalization of Lovass's sandwich theorem, W. Cook & P. Seymour,?Polyhedral Combinatorics: Proc. of a DIMACS Workshop, American Mathematical Society, 1990."},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"B. Nekooie, and M.K.H. Fan, ?A quadratically convergent local algorithm on minimizing sums of the largest eigenvalue of a symmetric matrix,? Proc. of 31th IEEE Conf. on Decision and Control Tucson, Arizona, December 1992, 1915?1920.","DOI":"10.1109\/CDC.1992.371097"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0609021","volume":"9","author":"M.L. Overton","year":"1988","unstructured":"M.L. Overton, ?On minimizing the maximum eigenvalue of a symmetric matrix,?SIAM J. Matrix Anal. Appl. 9 (1988), 256?268.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"M.L. Overton, and R.S. Womersley, ?On the sum of the largest eigenvalues of a symmetric matrix,?SIAM J. Matrix Anal. Appl. (1992), 41?45.","DOI":"10.1137\/0613006"},{"key":"CR22","doi-asserted-by":"crossref","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. to appear.","DOI":"10.1007\/BF01585173"},{"key":"CR23","unstructured":"A. Shapiro, and M.K.H. Fan, ?Generic analysis of optimization problems involving eigenvalues of symmetric matrices,? in preparation."},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"N.-K. Tsing, M.K.H. Fan, and E.I. Verriest, ?On analyticity of functions involving eigenvalues,?Linear Algebra and Its Applications, to appear.","DOI":"10.1016\/0024-3795(94)90009-4"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299152.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01299152\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299152","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:46:26Z","timestamp":1586180786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01299152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["BF01299152"],"URL":"https:\/\/doi.org\/10.1007\/bf01299152","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}