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

Descripción completa

Detalles Bibliográficos
Autores principales: Jiang, Min, Meng, Zhiqing, Shen, Rui
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2021
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7909753/
https://www.ncbi.nlm.nih.gov/pubmed/33494147
http://dx.doi.org/10.3390/e23020132

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7909753/
https://www.ncbi.nlm.nih.gov/pubmed/33494147
http://dx.doi.org/10.3390/e23020132

Ejemplares similares