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: | , |
|---|---|
| Format: | Other |
| Sprog: | engelsk |
| Udgivet: |
The Institute of National Planning
2018
|
| Fag: | |
| Online adgang: | http://repository.inp.edu.eg/xmlui/handle/123456789/4095 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|
Search Result 1