{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T07:18:18Z","timestamp":1763018298770,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T00:00:00Z","timestamp":1611187200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Biconvex programming (or inequality constrained biconvex optimization) is an important model in solving many engineering optimization problems in areas like machine learning and signal and information processing. In this paper, the partial exactness of the partial optimum for the penalty function of biconvex programming is studied. The penalty function is partially exact if the partial Karush\u2013Kuhn\u2013Tucker (KKT) condition is true. The sufficient and necessary partially local stability condition used to determine whether the penalty function is partially exact for a partial optimum solution is also proven. Based on the penalty function, an algorithm is presented for finding a partial optimum solution to an inequality constrained biconvex optimization, and its convergence is proven under some conditions.<\/jats:p>","DOI":"10.3390\/e23020132","type":"journal-article","created":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T02:36:05Z","timestamp":1611196565000},"page":"132","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Partial Exactness for the Penalty Function of Biconvex Programming"],"prefix":"10.3390","volume":"23","author":[{"given":"Min","family":"Jiang","sequence":"first","affiliation":[{"name":"School of Management, Zhejiang University of Technology, Hangzhou 310023, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4337-9300","authenticated-orcid":false,"given":"Zhiqing","family":"Meng","sequence":"additional","affiliation":[{"name":"School of Management, Zhejiang University of Technology, Hangzhou 310023, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8849-2836","authenticated-orcid":false,"given":"Rui","family":"Shen","sequence":"additional","affiliation":[{"name":"School of Economics, Zhejiang University of Technology, Hangzhou 310023, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,1,21]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Shen, X., Diamond, S., Udell, M., and Gu, Y. (2017, January 28\u201330). Disciplined multi-convex programming. Proceedings of the Control And Decision Conference (CCDC), Chongqing, China.","DOI":"10.1109\/CCDC.2017.7978647"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Liberti, L., and Maculan, N. (2006). Disciplined convex programming. Global Optimization: From Theory to Implementation, Nonconvex Optimization and its Applications, Springer.","DOI":"10.1007\/0-387-30528-9"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1109\/TSMC.2016.2571323","article-title":"Method of reduction of variables for bilinear matrix inequality problems in system and control designs","volume":"47","author":"Chiu","year":"2017","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"ref_4","unstructured":"Ichihara, H., and Nobuyama, E. (2003, January 4\u20136). Difference of multiconvex relaxation of parameterized LMIs: Control applications. Proceedings of the SICE 2003 Annual Conference, Fukui, Japan."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Hours, J., and Jones, C. (2014, January 15\u201317). A parametric multiconvex splitting technique with application to real-time NMPC. Proceedings of the 53rd IEEE Conference on Decision and Control, Los Angeles, CA, USA.","DOI":"10.1109\/CDC.2014.7040178"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10115-017-1147-9","article-title":"Localized user-driven topic discovery via boosted ensemble of nonnegative matrix factorization","volume":"56","author":"Suh","year":"2018","journal-title":"Knowl. Inf. Syst."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000055","article-title":"Generalized low rank models","volume":"9","author":"Udell","year":"2016","journal-title":"Found. Trends Mach. Learn."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/LSP.2018.2789405","article-title":"On identifiability of nonnegative matrix factorization","volume":"25","author":"Fu","year":"2018","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10107-016-1034-2","article-title":"On the linear convergence of the alternating direction method of multipliers","volume":"162","author":"Hong","year":"2017","journal-title":"Math. Program."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/TSP.2003.819988","article-title":"Transceiver optimization for multiuser MIMO systems","volume":"52","author":"Serbetli","year":"2004","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"3199","DOI":"10.1109\/TWC.2016.2517632","article-title":"Maximizing the Sum Rate in Cellular Networks Using Multiconvex Optimization","volume":"15","author":"Li","year":"2016","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","article-title":"Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm","volume":"4","author":"Wen","year":"2012","journal-title":"Math. Program. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1758","DOI":"10.1137\/120887795","article-title":"A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion","volume":"6","author":"Xu","year":"2013","journal-title":"Siam J. Imaging Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s00186-007-0161-1","article-title":"Biconvex sets and optimization with biconvex functions: A survey and extensions","volume":"66","author":"Gorski","year":"2007","journal-title":"Math. Methods Oper. Res."},{"key":"ref_15","first-page":"1","article-title":"Preconditioned ADMM for a class of bilinear programming problems","volume":"2018","author":"Liang","year":"2018","journal-title":"Math. Probl. Eng."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10898-017-0594-x","article-title":"Alternating direction method of multipliers for a class of nonconvex bilinear optimization: Convergence analysis and applications","volume":"70","author":"Hajinezhad","year":"2018","journal-title":"J. Glob. Optim."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.cor.2017.07.015","article-title":"A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints","volume":"89","author":"Charkhgard","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.sysconle.2015.01.003","article-title":"Iterative identification of block-oriented nonlinear systems based on biconvex optimization","volume":"79","author":"Li","year":"2015","journal-title":"Syst. Control. Lett."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Shah, S., Yadav, A.K., Castillo, C.D., Jacobs, D.W., Studer, C., and Goldstein, T. (2016, January 8\u201316). Biconvex Relaxation for Semidefinite Programming in Computer Vision. Proceedings of the European Conference on Computer Vision: Computer Vision, Amsterdam, The Netherlands.","DOI":"10.1007\/978-3-319-46466-4_43"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","article-title":"Jointly constrained biconvex programming","volume":"8","author":"Falk","year":"1983","journal-title":"Math. Oper. Res."},{"key":"ref_21","unstructured":"Pardalos, P.M., and Resende, M.G.C. (2002). Handbook of Applied optimization, Oxford University Press."},{"key":"ref_22","first-page":"334","article-title":"Nonlinear programming via penalty function","volume":"13","author":"Zangwill","year":"1967","journal-title":"Manag. Sci."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/moor.6.3.437","article-title":"Globally convergent algorithms for convex programming","volume":"6","author":"Rosenberg","year":"1981","journal-title":"Math. Oper. Res."},{"key":"ref_24","first-page":"1","article-title":"An exact penalty function method with global conergence properties for nonlinear programming problems","volume":"36","author":"Grippo","year":"1981","journal-title":"Math. Program."},{"key":"ref_25","unstructured":"Clarke, F.H. (1983). Optimization and Nonsmooth Analysis, Wiley."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0329027","article-title":"Calmness and exact penalization","volume":"29","author":"Burke","year":"1991","journal-title":"Siam J. Control. Optim."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Strongin, R.G., and Sergeyev, Y.D. (2000). Global Optimization with Non-Convex Constraints, Science & Business.","DOI":"10.1007\/978-1-4615-4677-1"},{"key":"ref_28","unstructured":"Grishagin, V., and Israfilov, R. (2021, January 16). Multidimensional Constrained Global Optimization in Domains with Computable Boundaries. Available online: https:\/\/elar.urfu.ru\/bitstream\/10995\/36002\/1\/ural_pdc-2015-09.pdf."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1287\/moor.1060.0217","article-title":"Lagrange Multipliers and Calmness Conditions of Order p","volume":"32","author":"Yang","year":"2007","journal-title":"Math. Oper. Res."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1142\/S0217595920400187","article-title":"Smoothing Partially Exact Penalty Function of Biconvex Programming","volume":"37","author":"Shen","year":"2020","journal-title":"Asia-Pac. J. Oper. Res."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/2\/132\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:13:20Z","timestamp":1760159600000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/2\/132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,21]]},"references-count":30,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2021,2]]}},"alternative-id":["e23020132"],"URL":"https:\/\/doi.org\/10.3390\/e23020132","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2021,1,21]]}}}