Lagrange Multiplier Method for Convex Programs
The problem of minimizing a convex function that is subject to the constraint that a number of other convex functions be nonpositive can be treated by the Lagrange multiplier method. Such a treatment was revived by Kuhn and Tucker and further studied by many other scientists. These studies led to an...
Сохранить в:
| Опубликовано в:: | Proc Natl Acad Sci U S A |
|---|---|
| Главный автор: | |
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
National Academy of Sciences
1975
|
| Предметы: | |
| Online-ссылка: | https://ncbi.nlm.nih.govhttps://pmc.ncbi.nlm.nih.gov/articles/PMC432629/ https://ncbi.nlm.nih.govhttps://pubmed.ncbi.nlm.nih.gov/16578726/ https://ncbi.nlm.nih.govhttps://doi.org/10.1073/pnas.72.5.1778 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|