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...
Saved in:
| Main Authors: | Congying Han, Mingqiang Li, Tong Zhao, Tiande Guo |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2013/246596 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Active-Set Algorithm for Convex Quadratic Programming Subject to Box Constraints with Applications in Non-Linear Optimization and Machine Learning
by: Konstantinos Vogklis, et al.
Published: (2025-04-01) -
A Relax Inexact Accelerated Proximal Gradient Method for the Constrained Minimization Problem of Maximum Eigenvalue Functions
by: Wei Wang, et al.
Published: (2014-01-01) -
Linear Simultaneous Equations’ Neural Solution and Its Application to Convex Quadratic Programming with Equality-Constraint
by: Yuhuan Chen, et al.
Published: (2013-01-01) -
Parallel Variable Distribution Algorithm for Constrained Optimization with Nonmonotone Technique
by: Congying Han, et al.
Published: (2013-01-01) -
Study on Indefinite Stochastic Linear Quadratic Optimal Control with Inequality Constraint
by: Guiling Li, et al.
Published: (2013-01-01)