An accelerating algorithm for globally solving nonconvex quadratic programming
Abstract To globally solve a nonconvex quadratic programming problem, this paper presents an accelerating linearizing algorithm based on the framework of the branch-and-bound method. By utilizing a new linear relaxation approach, the initial quadratic programming problem is reduced to a sequence of...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
SpringerOpen
2018-07-01
|
| coleção: | Journal of Inequalities and Applications |
| Assuntos: | |
| Acesso em linha: | http://link.springer.com/article/10.1186/s13660-018-1764-1 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|