Cargando…

An accelerating algorithm for globally solving nonconvex quadratic programming

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 linear re...

Descripción completa

Detalles Bibliográficos
Autores principales: Ge, Li, Liu, Sanyang
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2018
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6061662/
https://www.ncbi.nlm.nih.gov/pubmed/30137906
http://dx.doi.org/10.1186/s13660-018-1764-1

Ejemplares similares