טוען...
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...
שמור ב:
| מחבר ראשי: | |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
1975
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC432629/ https://ncbi.nlm.nih.gov/pubmed/16578726 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|