Načítá se...
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...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
1975
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC432629/ https://ncbi.nlm.nih.gov/pubmed/16578726 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|