Učitavanje...

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

Cijeli opis

Spremljeno u:
Bibliografski detalji
Izdano u:Entropy (Basel)
Glavni autori: Jiang, Min, Meng, Zhiqing, Shen, Rui
Format: Artigo
Jezik:Inglês
Izdano: MDPI 2021
Teme:
Online pristup:https://ncbi.nlm.nih.gov/pmc/articles/PMC7909753/
https://ncbi.nlm.nih.gov/pubmed/33494147
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/e23020132
Oznake: Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!