A comparative analysis of some methods for solving quadratic programming problems
The problem of quadratic programming is that of minimizing a convex function subject linear constraints. It is one of the simplest cases of nonlinear programming.
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Other |
| 语言: | 英语 |
| 出版: |
The Institute of National Planning
2018
|
| 主题: | |
| 在线阅读: | http://repository.inp.edu.eg/xmlui/handle/123456789/4095 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
| 总结: | The problem of quadratic programming is that of minimizing a convex function subject linear constraints. It is one of the simplest cases of nonlinear programming. |
|---|