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.
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Other |
| Langue: | anglais |
| Publié: |
The Institute of National Planning
2018
|
| Sujets: | |
| Accès en ligne: | http://repository.inp.edu.eg/xmlui/handle/123456789/4095 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|