A range division and contraction approach for nonconvex quadratic program with quadratic constraints

This paper presents a novel range division and contraction approach for globally solving nonconvex quadratic program with quadratic constraints. By constructing new underestimating linear relaxation functions, we can transform the initial nonconvex quadratic program problem into a linear program rel...

Descripción completa

Detalles Bibliográficos
Autores principales: Xue, Chunshan, Jiao, Hongwei, Yin, Jingben, Chen, Yongqiang
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2016
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4942453/
https://www.ncbi.nlm.nih.gov/pubmed/27462512
http://dx.doi.org/10.1186/s40064-016-2735-y

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4942453/
https://www.ncbi.nlm.nih.gov/pubmed/27462512
http://dx.doi.org/10.1186/s40064-016-2735-y

Ejemplares similares