Yüklüyor......
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...
Kaydedildi:
| Yazar: | |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
1975
|
| Konular: | |
| Online Erişim: | https://ncbi.nlm.nih.gov/pmc/articles/PMC432629/ https://ncbi.nlm.nih.gov/pubmed/16578726 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|