Cargando…
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...
Autores principales: | Han, Congying, Li, Mingqiang, Zhao, Tong, Guo, Tiande |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2013
|
Materias: | |
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 |
Ejemplares similares
-
An accelerating algorithm for globally solving nonconvex quadratic programming
por: Ge, Li, et al.
Publicado: (2018) -
Creating Better Collision-Free Trajectory for Robot Motion Planning by Linearly Constrained Quadratic Programming
por: Liu, Yizhou, et al.
Publicado: (2021) -
A range division and contraction approach for nonconvex quadratic program with quadratic constraints
por: Xue, Chunshan, et al.
Publicado: (2016) -
Interior point approach to linear, quadratic and convex programming: algorithms and complexity
por: Hertog, D
Publicado: (1994) -
Optimal Quadratic Programming Algorithms
por: Dostal, Zdenek
Publicado: (2009)