{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:11:09Z","timestamp":1780636269520,"version":"3.54.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T00:00:00Z","timestamp":1630627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T00:00:00Z","timestamp":1630627200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 11871434"],"award-info":[{"award-number":["No. 11871434"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["No. LY18A010031"],"award-info":[{"award-number":["No. LY18A010031"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10898-021-01064-5","type":"journal-article","created":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T19:51:27Z","timestamp":1630698687000},"page":"599-620","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An objective penalty function method for biconvex programming"],"prefix":"10.1007","volume":"81","author":[{"given":"Zhiqing","family":"Meng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9091-4230","authenticated-orcid":false,"given":"Min","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leiyan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chuangyin","family":"Dang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,9,3]]},"reference":[{"key":"1064_CR1","doi-asserted-by":"publisher","unstructured":"Shen, X., Diamond, S., Udell, M., Gu, Y.: Disciplined multi-convex programming. In: Control and Decision Conference (CCDC), Chongqing, Chinese. https:\/\/doi.org\/10.1109\/CCDC.2017.7978647 (2017)","DOI":"10.1109\/CCDC.2017.7978647"},{"key":"1064_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/0-387-30528-9_7","volume-title":"Global Optimization: From Theory to Implementation, Nonconvex Optimization and Its Applications","author":"M Grant","year":"2006","unstructured":"Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming. In: Liberti, L., Maculan, N. (eds.) Global Optimization: From Theory to Implementation, Nonconvex Optimization and Its Applications, pp. 155\u2013210. Springer, Berlin (2006)"},{"issue":"7","key":"1064_CR3","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1109\/TSMC.2016.2571323","volume":"47","author":"WY Chiu","year":"2017","unstructured":"Chiu, W.Y.: Method of reduction of variables for bilinear matrix inequality problems in system and control designs. IEEE Trans. Syst. Man Cybern. Syst. 47(7), 1241\u20131256 (2017)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"1064_CR4","unstructured":"Ichihara, H., Nobuyama, E.: Difference of multiconvex relaxation of parameterized LMIs: control applications. In: SICE 2003 Annual Conference (2003)"},{"key":"1064_CR5","doi-asserted-by":"crossref","unstructured":"Hours, J., Jones, C.: A parametric multiconvex splitting technique with application to real-time NMPC. In: 53rd IEEE Conference on Decision and Control, pp. 5052\u20135057 (2014)","DOI":"10.1109\/CDC.2014.7040178"},{"key":"1064_CR6","doi-asserted-by":"publisher","unstructured":"Suh, S., Shin, S., Lee, J., Reddy, C.K., Choo, J.: Localized user-driven topic discovery via boosted ensemble of nonnegative matrix factorization. Knowl. Inf. Syst. https:\/\/doi.org\/10.1007\/s10115-017-1147-9 (2018)","DOI":"10.1007\/s10115-017-1147-9"},{"issue":"1","key":"1064_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000055","volume":"9","author":"M Udell","year":"2016","unstructured":"Udell, M., Horn, C., Zadeh, R., Boyd, S.: Generalized low rank models. Found. Trends Mach. Learn. 9(1), 1\u2013118 (2016)","journal-title":"Found. Trends Mach. Learn."},{"issue":"3","key":"1064_CR8","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/LSP.2018.2789405","volume":"25","author":"X Fu","year":"2018","unstructured":"Fu, X., Huang, K., Sidiropoulos, N.D.: On identifiability of nonnegative matrix factorization. IEEE Signal Process. Lett. 25(3), 328\u2013332 (2018)","journal-title":"IEEE Signal Process. Lett."},{"issue":"1","key":"1064_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/TSP.2003.819988","volume":"52","author":"S Serbetli","year":"2004","unstructured":"Serbetli, S., Yener, A.: Transceiver optimization for multiuser MIMO systems. IEEE Trans. Signal Process. 52(1), 214\u2013226 (2004)","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"1064_CR10","doi-asserted-by":"publisher","first-page":"3199","DOI":"10.1109\/TWC.2016.2517632","volume":"15","author":"H Al-Shatri","year":"2016","unstructured":"Al-Shatri, H., Li, X., Ganesa, R.S.S.: Maximizing the sum rate in cellular networks using multiconvex optimization. IEEE Trans. Wirel. Commun. 15(5), 3199\u20133211 (2016)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"4","key":"1064_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"Z Wen","year":"2012","unstructured":"Wen, Z., Yin, W., Zhang, Y.: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math. Program. Comput. 4(4), 333\u2013361 (2012)","journal-title":"Math. Program. Comput."},{"key":"1064_CR12","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10107-016-1034-2","volume":"162","author":"M Hong","year":"2017","unstructured":"Hong, M., Luo, Z.: On the linear convergence of the alternating direction method of multipliers. Math. Program. 162, 165\u2013199 (2017)","journal-title":"Math. Program."},{"issue":"3","key":"1064_CR13","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Yin, W.: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imaging Sci. 6(3), 1758\u20131789 (2013)","journal-title":"SIAM J. Imaging Sci."},{"key":"1064_CR14","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00186-007-0161-1","volume":"66","author":"J Gorski","year":"2007","unstructured":"Gorski, J., Pfeuffer, F., Klamroth, K.: Biconvex sets and optimization with biconvex functions: a survey and extensions. Math. Methods Oper. Res. 66, 373\u2013407 (2007)","journal-title":"Math. Methods Oper. Res."},{"key":"1064_CR15","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.sysconle.2015.01.003","volume":"79","author":"G Li","year":"2015","unstructured":"Li, G., Wen, C., Zheng, W.X., Zhao, G.: Iterative identification of block-oriented nonlinear systems based on biconvex optimization. Syst. Control Lett. 79, 68\u201375 (2015)","journal-title":"Syst. Control Lett."},{"key":"1064_CR16","doi-asserted-by":"crossref","unstructured":"Shah, S., Yadav, A.K., Castillo, C.D., Jacobs, D.W., Studer, C., Goldstein, T.: Biconvex Relaxation for semidefinite programming in computer vision. In: European Conference on Computer Vision: Computer Vision, pp. 717\u2013735 (2016)","DOI":"10.1007\/978-3-319-46466-4_43"},{"issue":"2","key":"1064_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"AA Faiz","year":"1983","unstructured":"Faiz, A.A., James, E.F.: jointly constrained biconvex programming. Math. Oper. Res. 8(2), 273\u2013286 (1983)","journal-title":"Math. Oper. Res."},{"key":"1064_CR18","first-page":"1","volume":"2018","author":"X Liang","year":"2018","unstructured":"Liang, X., Bai, J.: Preconditioned ADMM for a class of bilinear programming problems. Math. Probl. Eng. 2018, 1\u20139 (2018)","journal-title":"Math. Probl. Eng."},{"key":"1064_CR19","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10898-017-0594-x","volume":"70","author":"D Hajinezhad","year":"2018","unstructured":"Hajinezhad, D., Shi, Q.J.: Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications. J. Glob. Optim. 70, 261\u201388 (2018)","journal-title":"J. Glob. Optim."},{"key":"1064_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.cor.2017.07.015","volume":"89","author":"H Charkhgard","year":"2018","unstructured":"Charkhgard, H., Savelsbergh, M., Talebian, M.: A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints. Comput. Oper. Res. 89, 17\u201330 (2018)","journal-title":"Comput. Oper. Res."},{"key":"1064_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5362-2","volume-title":"Handbook of Applied Optimization","author":"PM Pardalos","year":"2002","unstructured":"Pardalos, P.M., Resende, M.G.C.: Handbook of Applied Optimization. Oxford University Press, Oxford (2002)"},{"key":"1064_CR22","first-page":"334","volume":"13","author":"WI Zangwill","year":"1967","unstructured":"Zangwill, W.I.: Nonlinear programming via penalty function. Manang. Sci. 13, 334\u2013358 (1967)","journal-title":"Manang. Sci."},{"key":"1064_CR23","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1287\/moor.6.3.437","volume":"6","author":"E Rosenberg","year":"1981","unstructured":"Rosenberg, E.: Globally convergent algorithms for convex programming. Math. Oper. Res. 6, 437\u2013443 (1981)","journal-title":"Math. Oper. Res."},{"key":"1064_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02591986","volume":"36","author":"G Di Pillo","year":"1981","unstructured":"Di Pillo, G., Grippo, L.: An exact penalty function method with global convergence properties for nonlinear programming problems. Math. Program. 36, 1\u201318 (1981)","journal-title":"Math. Program."},{"key":"1064_CR25","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)"},{"key":"1064_CR26","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1137\/0329027","volume":"29","author":"JV Burke","year":"1991","unstructured":"Burke, J.V.: Calmness and exact penalization. SIAM J. Control. Optim. 29, 493\u2013497 (1991)","journal-title":"SIAM J. Control. Optim."},{"key":"1064_CR27","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/0705006","volume":"5","author":"DD Morrison","year":"1968","unstructured":"Morrison, D.D.: Optimization by least squares. SIAM J. Numer. Anal. 5, 83\u201388 (1968)","journal-title":"SIAM J. Numer. Anal."},{"key":"1064_CR28","volume-title":"Practical Method of Optimization","author":"R Fletcher","year":"1981","unstructured":"Fletcher, R.: Practical Method of Optimization. A Wiley-Interscience Publication, New York (1981)"},{"key":"1064_CR29","doi-asserted-by":"crossref","unstructured":"Fletcher, R.: Penalty functions. In: Bachem, A., Grotschel, M., Korte, B. (eds) Mathematical Programming: The State of the Art. Springer, Berlin (1983)","DOI":"10.1007\/978-3-642-68874-4_5"},{"key":"1064_CR30","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1137\/0329054","volume":"29","author":"JV Burke","year":"1991","unstructured":"Burke, J.V.: An exact penalization viewpoint of constrained optimization. SIAM J. Control Optim. 29, 968\u2013998 (1991)","journal-title":"SIAM J. Control Optim."},{"key":"1064_CR31","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization techniques","author":"AV Fiacco","year":"1968","unstructured":"Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization techniques. Wiley, New York (1968)"},{"key":"1064_CR32","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1008329405026","volume":"16","author":"D Mauricio","year":"2000","unstructured":"Mauricio, D., Maculan, N.: A Boolean penalty method for zero-one nonlinear programming. J. Glob. Optim. 16, 343\u2013354 (2000)","journal-title":"J. Glob. Optim."},{"key":"1064_CR33","doi-asserted-by":"crossref","first-page":"585","DOI":"10.3934\/jimo.2009.5.585","volume":"5","author":"ZQ Meng","year":"2009","unstructured":"Meng, Z.Q., Hu, Q.Y., Dang, C.Y.: A penalty function algorithm with objective parameters for nonlinear mathematical programming. J. Ind. Manag. Optim. 5, 585\u2013601 (2009)","journal-title":"J. Ind. Manag. Optim."},{"key":"1064_CR34","doi-asserted-by":"crossref","unstructured":"Meng, Z., Dang, C., Jiang, M., Xinsheng, X., Shen, R.: Exactness and algorithm of an objective penalty function. J. Glob. Optim. 56(2), 691\u2013711 (2013)","DOI":"10.1007\/s10898-012-9900-9"},{"key":"1064_CR35","doi-asserted-by":"publisher","first-page":"132","DOI":"10.3390\/e23020132","volume":"23","author":"M Jiang","year":"2021","unstructured":"Jiang, M., Meng, Z., Shen, R.: Partially exactness for the penalty function of biconvex programming. Entropy 23, 132 (2021). https:\/\/doi.org\/10.3390\/e23020132","journal-title":"Entropy"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01064-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01064-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01064-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T15:38:06Z","timestamp":1673192286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01064-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,3]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1064"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01064-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,3]]},"assertion":[{"value":"24 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}