{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:41Z","timestamp":1740122741663,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,2,2]],"date-time":"2016-02-02T00:00:00Z","timestamp":1454371200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11171217","11571234"],"award-info":[{"award-number":["11171217","11571234"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10589-016-9825-1","type":"journal-article","created":{"date-parts":[[2016,2,2]],"date-time":"2016-02-02T00:18:06Z","timestamp":1454372286000},"page":"647-670","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing the distance between the linear matrix pencil and the completely positive cone"],"prefix":"10.1007","volume":"64","author":[{"given":"Jinyan","family":"Fan","sequence":"first","affiliation":[]},{"given":"Anwa","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,2]]},"reference":[{"key":"9825_CR1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2001)"},{"key":"9825_CR2","doi-asserted-by":"crossref","DOI":"10.1142\/5273","volume-title":"Completely Positive Matrices","author":"A Berman","year":"2003","unstructured":"Berman, A., Shaked-Monderer, N.: Completely Positive Matrices. World Scientific, Singapore (2003)"},{"key":"9825_CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., de Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24, 163\u2013185 (2002)","journal-title":"J. Global Optim."},{"key":"9825_CR4","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ejor.2011.04.026","volume":"216","author":"IM Bomze","year":"2012","unstructured":"Bomze, I.M.: Copositive optimization-recent developments and applications. Eur. J. Oper. Res. 216, 509\u2013520 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"9825_CR5","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. Ser. A 120, 479\u2013495 (2009)","journal-title":"Math. Program. Ser. A"},{"key":"9825_CR6","first-page":"189","volume":"54","author":"R Curto","year":"2005","unstructured":"Curto, R., Fialkow, L.: Truncated K-moment problems in several variables. J. Oper. Theory 54, 189\u2013226 (2005)","journal-title":"J. Oper. Theory"},{"key":"9825_CR7","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E Klerk de","year":"2002","unstructured":"de Klerk, E., Pasechnik, D.V.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12, 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"key":"9825_CR8","unstructured":"Dickinson, P.J.: The copositive cone, the completely positive cone and their generalisations. PhD thesis, Aniversity of Groningen, Groningen, The Netherlands (2013)"},{"key":"9825_CR9","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10589-013-9594-z","volume":"57","author":"PJ Dickinson","year":"2014","unstructured":"Dickinson, P.J., Gijben, L.: On the computational complexity of membership problems for the completely positive cone and its dual. Comput. Optim. Appl. 57, 403\u2013415 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"9825_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-642-12598-0_1","volume-title":"Recent Advances in Optimization and Its Applications in Engineering","author":"M D\u00fcr","year":"2010","unstructured":"D\u00fcr, M.: Copositive programming\u2014a survey. In: Diehl, M., Glineur, F., Jarlebring, E., Michiels, W. (eds.) Recent Advances in Optimization and Its Applications in Engineering, pp. 3\u201320. Springer, Berlin (2010)"},{"key":"9825_CR11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10107-006-0062-8","volume":"110","author":"N Gvozdenovi\u0107","year":"2007","unstructured":"Gvozdenovi\u0107, N., Laurent, M.: Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. Math. Program. Ser. B 110, 145\u2013173 (2007)","journal-title":"Math. Program. Ser. B"},{"key":"9825_CR12","doi-asserted-by":"crossref","first-page":"1682","DOI":"10.1016\/j.jfa.2012.06.004","volume":"263","author":"L Fialkow","year":"2012","unstructured":"Fialkow, L., Nie, J.: The truncated moment problem via homogenization and flat extensions. J. Funct. Anal. 263, 1682\u20131700 (2012)","journal-title":"J. Funct. Anal."},{"key":"9825_CR13","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1007\/s10208-012-9132-x","volume":"12","author":"JW Helton","year":"2012","unstructured":"Helton, J.W., Nie, J.: A semidefinite approach for truncated K-moment problems. Found. Comput. Math. 12, 851\u2013881 (2012)","journal-title":"Found. Comput. Math."},{"key":"9825_CR14","first-page":"293","volume-title":"Detecting Global Optimality and Extracting Solutions in GloptiPoly, Positive Polynomials in Control. Lecture Notes in Control and Information Science","author":"D Henrion","year":"2005","unstructured":"Henrion, D., Lasserre, J.: Detecting Global Optimality and Extracting Solutions in GloptiPoly, Positive Polynomials in Control. Lecture Notes in Control and Information Science, pp. 293\u2013310. Springer, Berlin (2005)"},{"key":"9825_CR15","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1080\/10556780802699201","volume":"24","author":"D Henrion","year":"2009","unstructured":"Henrion, D., Lasserre, J., Loefberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24, 761\u2013779 (2009)","journal-title":"Optim. Methods Softw."},{"key":"9825_CR16","doi-asserted-by":"crossref","DOI":"10.1142\/p665","volume-title":"Moments, Positive Polynomials and Their Applications","author":"JB Lasserre","year":"2009","unstructured":"Lasserre, J.B.: Moments, Positive Polynomials and Their Applications. Imperial College Press, London (2009)"},{"key":"9825_CR17","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10107-013-0632-5","volume":"144","author":"JB Lasserre","year":"2014","unstructured":"Lasserre, J.B.: New approximations for the cone of copositive matrices and its dual. Math. Program. Ser. A 144, 265\u2013276 (2014)","journal-title":"Math. Program. Ser. A"},{"key":"9825_CR18","first-page":"157","volume-title":"Sums of Squares, Moment Matrices and Optimization Over Polynomials, Emerging Applications of Algebraic Geometry. IMA Volumes in Mathematics and Its Applications","author":"M Laurent","year":"2009","unstructured":"Laurent, M.: Sums of Squares, Moment Matrices and Optimization Over Polynomials, Emerging Applications of Algebraic Geometry. IMA Volumes in Mathematics and Its Applications, vol. 149, pp. 157\u2013270. Springer, New York (2009)"},{"key":"9825_CR19","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty, K.G., Kabadi, S.N.: Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39, 117\u2013129 (1987)","journal-title":"Math. Program."},{"key":"9825_CR20","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.jco.2006.07.002","volume":"23","author":"J Nie","year":"2007","unstructured":"Nie, J., Schweighofer, M.: On the complexity of Putinar\u2019s Positivstellensatz. J. Complex. 23, 135\u2013150 (2007)","journal-title":"J. Complex."},{"key":"9825_CR21","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1007\/s10208-014-9225-9","volume":"14","author":"J Nie","year":"2014","unstructured":"Nie, J.: The $$A$$ A -truncated K-moment problem. Found. Comput. Math. 14, 1243\u20131276 (2014)","journal-title":"Found. Comput. Math."},{"key":"9825_CR22","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10107-014-0797-6","volume":"153","author":"J Nie","year":"2015","unstructured":"Nie, J.: Linear optimization with cones of moments and nonnegative polynomials. Math. Program. Ser. B 153, 247\u2013274 (2015)","journal-title":"Math. Program. Ser. B"},{"key":"9825_CR23","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10107-013-0680-x","volume":"146","author":"J Nie","year":"2014","unstructured":"Nie, J.: Optimality conditions and finite convergence of Lasserre\u2019s hierarchy. Math. Program. Ser. A 146, 97\u2013121 (2014)","journal-title":"Math. Program. Ser. A"},{"key":"9825_CR24","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/080716670","volume":"20","author":"J Nie","year":"2009","unstructured":"Nie, J., Ranestad, K.: Algebraic degree of polynomial optimization. SIAM J. Optim. 20, 485\u2013502 (2009)","journal-title":"SIAM J. Optim."},{"key":"9825_CR25","unstructured":"Papachristodoulou, A., Anderson, J., Valmorbida, G., Prajna, S., Seiler, P., Parrilo, P.A.: SOSTOOLS: sum of squares optimization toolbox for MATLAB (2013). Available from http:\/\/www.eng.ox.ac.uk\/control\/sostools"},{"key":"9825_CR26","unstructured":"Parrilo, P. A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. Dissertation, California Institute of Technology (2000)"},{"key":"9825_CR27","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/05064401X","volume":"18","author":"J Pe\u00f1a","year":"2007","unstructured":"Pe\u00f1a, J., Vera, J., Zuluaga, L.: Computing the stability number of a graph via linear and semidenite programming. SIAM J. Optim. 18, 87\u2013105 (2007)","journal-title":"SIAM J. Optim."},{"key":"9825_CR28","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M Putinar","year":"1993","unstructured":"Putinar, M.: Positive polynomials on compact semi-algebraic sets. Ind. Aniv. Math. J. 42, 969\u2013984 (1993)","journal-title":"Ind. Aniv. Math. J."},{"key":"9825_CR29","first-page":"585","volume":"328","author":"M Putinar","year":"1999","unstructured":"Putinar, M., Vasilescu, F.-H.: Positive polynomials on semialgebraic sets. C. R. Acad. Sci. Ser. I 328, 585\u2013589 (1999)","journal-title":"C. R. Acad. Sci. Ser. I"},{"key":"9825_CR30","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/978-1-4615-4381-7_4","volume-title":"Handbook of Semidefinite Programming","author":"A Shapiro","year":"2000","unstructured":"Shapiro, A., Scheinberg, K.: Duality and optimality conditions. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Handbook of Semidefinite Programming, vol. 27, pp. 67\u2013110. Springer, New York (2000)"},{"key":"9825_CR31","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11 & 12","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: SeDuMi 1.02: a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11 & 12, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"9825_CR32","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/s10898-015-0309-0","volume":"63","author":"A Zhou","year":"2015","unstructured":"Zhou, A., Fan, J.: Interiors of completely positive cones. J. Global Optim. 63, 653\u2013675 (2015)","journal-title":"J. Global Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9825-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9825-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9825-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T14:37:41Z","timestamp":1559227061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9825-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,2]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["9825"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9825-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2016,2,2]]}}}