An Accelerated Proximal Gradient Algorithm for Singly Linearly Constrained Quadratic Programs with Box Constraints

Recently, the existed proximal gradient algorithms had been used to solve non-smooth convex optimization problems. As a special nonsmooth convex problem, the singly linearly constrained quadratic programs with box constraints appear in a wide range of applications. Hence, we propose an accelerated p...

Descripción completa

Detalles Bibliográficos
Autores principales: Han, Congying, Li, Mingqiang, Zhao, Tong, Guo, Tiande
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2013
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3816075/
https://www.ncbi.nlm.nih.gov/pubmed/24223028
http://dx.doi.org/10.1155/2013/246596

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3816075/
https://www.ncbi.nlm.nih.gov/pubmed/24223028
http://dx.doi.org/10.1155/2013/246596

Ejemplares similares