Načítá se...
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...
Uloženo v:
| Vydáno v: | Entropy (Basel) |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
MDPI
2021
|
| Témata: | |
| On-line přístup: | 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 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|