An objective penalty function method for biconvex programming

[1]  Kathrin Klamroth,et al.  Biconvex sets and optimization with biconvex functions: a survey and extensions , 2007, Math. Methods Oper. Res..

[2]  Qingjiang Shi,et al.  Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications , 2017, Journal of Global Optimization.

[3]  Stephen P. Boyd,et al.  Disciplined Convex Programming , 2006 .

[4]  Zhiqing Meng,et al.  Partial Exactness for the Penalty Function of Biconvex Programming , 2021, Entropy.

[5]  Xiao Fu,et al.  On Identifiability of Nonnegative Matrix Factorization , 2017, IEEE Signal Processing Letters.

[6]  Anja Klein,et al.  Maximizing the Sum Rate in Cellular Networks Using Multiconvex Optimization , 2015, IEEE Transactions on Wireless Communications.

[7]  Jaegul Choo,et al.  Localized user-driven topic discovery via boosted ensemble of nonnegative matrix factorization , 2018, Knowledge and Information Systems.

[8]  Wei-Yu Chiu,et al.  Method of Reduction of Variables for Bilinear Matrix Inequality Problems in System and Control Designs , 2017, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[9]  R. Fletcher.  Penalty Functions , 1982, ISMP.

[10]  Stephen P. Boyd,et al.  Generalized Low Rank Models , 2014, Found. Trends Mach. Learn..

[11]  Eric Rosenberg,et al.  Globally Convergent Algorithms for Convex Programming , 1981, Math. Oper. Res..

[12]  Yin Zhang,et al.  Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm , 2012, Mathematical Programming Computation.

[13]  Min Jiang,et al.  Exactness and algorithm of an objective penalty function , 2013, J. Glob. Optim..

[14]  J. Burke.  An exact penalization viewpoint of constrained optimization , 1991 .

[15]  Zhi-Quan Luo,et al.  On the linear convergence of the alternating direction method of multipliers , 2012, Mathematical Programming.

[16]  Wei Xing Zheng,et al.  Iterative identification of block-oriented nonlinear systems based on biconvex optimization , 2015, Syst. Control. Lett..

[17]  Nelson Maculan,et al.  A Boolean Penalty Method for Zero-One Nonlinear Programming , 2000, J. Glob. Optim..

[18]  Martin W. P. Savelsbergh,et al.  A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints , 2018, Comput. Oper. Res..

[19]  James E. Falk,et al.  Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..

[20]  James V. Burke,et al.  Calmness and exact penalization , 1991 .

[21]  Aylin Yener,et al.  Transceiver optimization for multiuser MIMO systems , 2004, IEEE Transactions on Signal Processing.

[22]  Wotao Yin,et al.  A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion , 2013, SIAM J. Imaging Sci..

[23]  L. Grippo,et al.  An exact penalty function method with global convergence properties for nonlinear programming problems , 1986, Math. Program..

[24]  Carlos D. Castillo,et al.  Biconvex Relaxation for Semidefinite Programming in Computer Vision , 2016, ECCV.

[25]  D. D. Morrison.  Optimization by Least Squares , 1968 .