An objective penalty function method for biconvex programming

• Published in: Journal of global optimization Vol. 81; no. 3; pp. 599 - 620
• Main Authors: Meng, Zhiqing, Jiang, Min, Shen, Rui, Xu, Leiyan, Dang, Chuangyin
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.11.2021; Springer; Springer Nature B.V
• Subjects: Algorithms; Computer Science; Convergence; Equivalence; Kuhn-Tucker method; Mathematics; Mathematics and Statistics; Methods; Operations Research/Decision Theory; Optimization; Partial stability; Penalty function; Programming; Real Functions; Biconvex programming; Partial exactness; Partial optimum; Partial stability; Objective penalty function

Biconvex programming is nonconvex optimization describing many practical problems. The existing research shows that the difficulty in solving biconvex programming makes it a very valuable subject to find new theories and solution methods. This paper first obtains two important theoretical results ab...