{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:34Z","timestamp":1740122434289,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671036"],"award-info":[{"award-number":["11671036"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Grants Council of Hong Kong","award":["C1007-15G","C1007-15G"],"award-info":[{"award-number":["C1007-15G","C1007-15G"]}]},{"name":"Research Grants Council of Hong Kong","award":["C1007-15G"],"award-info":[{"award-number":["C1007-15G"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10898-017-0583-0","type":"journal-article","created":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T02:03:54Z","timestamp":1509329034000},"page":"237-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A quadratic penalty method for hypergraph matching"],"prefix":"10.1007","volume":"70","author":[{"given":"Chunfeng","family":"Cui","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1397-6200","authenticated-orcid":false,"given":"Qingna","family":"Li","sequence":"additional","affiliation":[]},{"given":"Liqun","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"issue":"1","key":"583_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10208-013-9161-0","volume":"14","author":"HH Bauschke","year":"2014","unstructured":"Bauschke, H.H., Luke, D.R., Phan, H.M., Wang, X.: Restricted normal cones and sparsity optimization with affine constraints. Found. Comput. Math. 14(1), 63\u201383 (2014)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"583_CR2","doi-asserted-by":"crossref","first-page":"1480","DOI":"10.1137\/120869778","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Eldar, Y.C.: Sparsity constrained nonlinear optimization: optimality conditions and algorithms. SIAM J. Optim. 23(3), 1480\u20131509 (2013)","journal-title":"SIAM J. Optim."},{"key":"583_CR3","first-page":"26","volume":"1","author":"AC Berg","year":"2005","unstructured":"Berg, A.C., Berg, T.L., Malik, J.: Shape matching and object recognition using low distortion correspondences. IEEE Conf. Comput. Vis. Pattern Recognit. 1, 26\u201333 (2005)","journal-title":"IEEE Conf. Comput. Vis. Pattern Recognit."},{"issue":"2","key":"583_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Projected newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20(2), 221\u2013246 (1982)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"583_CR5","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/140978077","volume":"26","author":"OP Burdakov","year":"2016","unstructured":"Burdakov, O.P., Kanzow, C., Schwartz, A.: Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method. SIAM J. Optim. 26(1), 397\u2013425 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"583_CR6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02592073","volume":"39","author":"PH Calamai","year":"1987","unstructured":"Calamai, P.H., Mor\u00e9, J.J.: Projected gradient methods for linearly constrained problems. Math. Program. 39(1), 93\u2013116 (1987)","journal-title":"Math. Program."},{"issue":"1","key":"583_CR7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10107-016-0986-6","volume":"160","author":"M Cervinka","year":"2016","unstructured":"Cervinka, M., Kanzow, C., Schwartz, A.: Constraint qualifications and optimality conditions for optimization problems with cardinality constraints. Math. Program. 160(1), 353\u2013377 (2016)","journal-title":"Math. Program."},{"key":"583_CR8","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1137\/15M1052834","volume":"55","author":"X Chen","year":"2017","unstructured":"Chen, X., Guo, L., Lu, Z., Ye, J.J.: An augmented lagrangian method for non-lipschitz nonconvex programming. SIAM J. Numer. Anal. 55, 168\u2013193 (2017)","journal-title":"SIAM J. Numer. Anal."},{"key":"583_CR9","doi-asserted-by":"crossref","unstructured":"Cui, C.F., Li, Q.N., Qi, L.Q., Yan, H.: A quadratic penalty method for hypergraph matching. arXiv:1704.04581v1 (2017)","DOI":"10.1007\/s10898-017-0583-0"},{"issue":"3","key":"583_CR10","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10107-005-0595-2","volume":"106","author":"Y-H Dai","year":"2006","unstructured":"Dai, Y.-H., Fletcher, R.: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math. Program. 106(3), 403\u2013421 (2006)","journal-title":"Math. Program."},{"issue":"12","key":"583_CR11","doi-asserted-by":"crossref","first-page":"2383","DOI":"10.1109\/TPAMI.2011.110","volume":"33","author":"O Duchenne","year":"2011","unstructured":"Duchenne, O., Bach, F., Kweon, I.-S., Ponce, J.: A tensor-based algorithm for high-order graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 33(12), 2383\u20132395 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"583_CR12","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TPAMI.2012.51","volume":"35","author":"A Egozi","year":"2013","unstructured":"Egozi, A., Keller, Y., Guterman, H.: A probabilistic approach to spectral graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 35(1), 18\u201327 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"583_CR13","doi-asserted-by":"crossref","first-page":"2284","DOI":"10.1137\/15M1048021","volume":"26","author":"B Jiang","year":"2016","unstructured":"Jiang, B., Liu, Y.F., Wen, Z.: $$L_p$$ L p -norm regularization algorithms for optimization over permutation matrices. SIAM J. Optim. 26(4), 2284\u20132313 (2016)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"583_CR14","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1109\/TPAMI.2007.1048","volume":"29","author":"H Jiang","year":"2007","unstructured":"Jiang, H., Drew, M.S., Li, Z.-N.: Matching by linear programming and successive convexification. IEEE Trans. Pattern Anal. Mach. Intell. 29(6), 959\u2013975 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"583_CR15","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. Complexity of Computer Computations. Springer US, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"583_CR16","doi-asserted-by":"crossref","unstructured":"Lee, J., Cho, M., Lee, K.M.: Hyper-graph matching via reweighted random walks. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1633\u20131640 (2011)","DOI":"10.1109\/CVPR.2011.5995387"},{"issue":"2","key":"583_CR17","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/TPAMI.2010.179","volume":"33","author":"J-H Lee","year":"2011","unstructured":"Lee, J.-H., Won, C.-H.: Topology preserving relaxation labelling for nonrigid point matching. IEEE Trans. Pattern Anal. Mach. Intell. 33(2), 427\u2013432 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"583_CR18","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s40305-015-0107-x","volume":"3","author":"X Li","year":"2015","unstructured":"Li, X., Song, W.: The first-order necessary conditions for sparsity constrained optimization. J. Oper. Res. Soc. China 3(4), 521\u2013535 (2015)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"1","key":"583_CR19","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1109\/TPAMI.2013.148","volume":"36","author":"R Litman","year":"2014","unstructured":"Litman, R., Bronstein, A.M.: Learning spectral descriptors for deformable shape correspondence. IEEE Trans. Pattern Anal. Mach. Intell. 36(1), 171\u2013180 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"583_CR20","doi-asserted-by":"crossref","first-page":"2448","DOI":"10.1137\/100808071","volume":"23","author":"Z Lu","year":"2013","unstructured":"Lu, Z., Zhang, Y.: Sparse approximation via penalty decomposition methods. SIAM J. Optim. 23(4), 2448\u20132478 (2013)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"583_CR21","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1109\/TPAMI.2003.1177151","volume":"25","author":"J Maciel","year":"2003","unstructured":"Maciel, J., Costeira, J.P.: A global solution to sparse correspondence problems. IEEE Trans. Pattern Anal. Mach. Intell. 25(2), 187\u2013199 (2003)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"583_CR22","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1109\/TPAMI.2016.2574706","volume":"39","author":"Q Nguyen","year":"2017","unstructured":"Nguyen, Q., Tudisco, F., Gautier, A., Hein, M.: An efficient multilinear optimization framework for hypergraph matching. IEEE Trans. Pattern Anal. Mach. Intell. 39(6), 1054\u20131075 (2017)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"583_CR23","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, Berlin (2006)"},{"issue":"5","key":"583_CR24","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1007\/s11425-016-9010-x","volume":"60","author":"L Pan","year":"2017","unstructured":"Pan, L., Xiu, N., Fan, J.: Optimality conditions for sparse nonlinear programming. Sci. China Math. 60(5), 759\u2013776 (2017)","journal-title":"Sci. China Math."},{"issue":"4","key":"583_CR25","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s40305-015-0101-3","volume":"3","author":"L Pan","year":"2015","unstructured":"Pan, L., Xiu, N., Zhou, S.: On solutions of sparsity constrained optimization. J. Oper. Res. Soc. China 3(4), 421\u2013439 (2015)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"2","key":"583_CR26","first-page":"325","volume":"13","author":"L Pan","year":"2017","unstructured":"Pan, L., Zhou, S., Xiu, N., Qi, H.: A convergent iterative hard thresholding for sparsity and nonnegativity constrained optimization. Pac. J. Optim. 13(2), 325\u2013353 (2017)","journal-title":"Pac. J. Optim."},{"key":"583_CR27","volume-title":"Optimization Theory and Methods: Nonlinear Programming","author":"WY Sun","year":"2006","unstructured":"Sun, W.Y., Yuan, Y.-X.: Optimization Theory and Methods: Nonlinear Programming, vol. 1. Springer, New York (2006)"},{"issue":"9","key":"583_CR28","doi-asserted-by":"crossref","first-page":"2137","DOI":"10.1002\/prot.24104","volume":"80","author":"M-Y Wu","year":"2012","unstructured":"Wu, M.-Y., Dai, D.-Q., Yan, H.: PRL-dock: protein-ligand docking based on hydrogen bond matching and probabilistic relaxation labeling. Proteins. Struct. Funct. Genet. 80(9), 2137\u20132153 (2012)","journal-title":"Proteins. Struct. Funct. Genet."},{"key":"583_CR29","doi-asserted-by":"crossref","unstructured":"Yan, H.: Efficient matching and retrieval of gene expression time series data based on spectral information. In: International Conference on Computational Science and Its Applications, pp. 357\u2013373 (2005)","DOI":"10.1007\/11424857_39"},{"key":"583_CR30","doi-asserted-by":"crossref","unstructured":"Yan, J., Zhang, C., Zha, H., Liu, W., Yang, X., Chu, S.M.: Discrete hyper-graph matching. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1520\u20131528 (2015)","DOI":"10.1109\/CVPR.2015.7298759"},{"key":"583_CR31","doi-asserted-by":"crossref","unstructured":"Zaragoza, J., Chin, T.-J., Brown, M.S., Suter, D.: As-projective-as-possible image stitching with moving DLT. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2339\u20132346 (2013)","DOI":"10.1109\/CVPR.2013.303"},{"issue":"7","key":"583_CR32","doi-asserted-by":"crossref","first-page":"1285","DOI":"10.1109\/TPAMI.2013.247","volume":"36","author":"J Zaragoza","year":"2014","unstructured":"Zaragoza, J., Chin, T.-J., Tran, Q.-H., Brown, M.S., Suter, D.: As-projective-as-possible image stitching with moving DLT. IEEE Trans. Pattern Anal. Mach. Intell. 36(7), 1285\u20131298 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"583_CR33","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1\u20138 (2008)","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"583_CR34","doi-asserted-by":"crossref","unstructured":"Zhou, J., Yan, H., Zhu, Y.: Local topology preserved tensor models for graph matching. In: International Conference on Systems, Man, and Cybernetics, pp. 2153\u20132157 (2015)","DOI":"10.1109\/SMC.2015.376"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0583-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0583-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0583-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T05:24:13Z","timestamp":1570253053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0583-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["583"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0583-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2017,10,30]]}}}