Linear decomposition approach for a class of nonconvex programming problems

This paper presents a linear decomposition approach for a class of nonconvex programming problems by dividing the input space into polynomially many grids. It shows that under certain assumptions the original problem can be transformed and decomposed into a polynomial number of equivalent linear pro...

Descripción completa

Detalles Bibliográficos
Autores principales: Shen, Peiping, Wang, Chunfeng
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2017
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5393259/
https://www.ncbi.nlm.nih.gov/pubmed/28473733
http://dx.doi.org/10.1186/s13660-017-1342-y

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5393259/
https://www.ncbi.nlm.nih.gov/pubmed/28473733
http://dx.doi.org/10.1186/s13660-017-1342-y

Ejemplares similares