Partial Exactness for the Penalty Function of Biconvex Programming

Partial Exactness for the Penalty Function of Biconvex Programming

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...

Full description

Bibliographic Details
Main Authors: Min Jiang, Zhiqing Meng, Rui Shen
Format: Article
Language:English
Published: MDPI AG 2021-01-01
Series:Entropy
Subjects:
biconvex programming
partial optimum
partially exact penalty function
partial exactness
partial local stability
Online Access:https://www.mdpi.com/1099-4300/23/2/132

Internet

https://www.mdpi.com/1099-4300/23/2/132

Similar Items