An Alternating Direction Method for Convex Quadratic Second-Order Cone Programming with Bounded Constraints
An alternating direction method is proposed for convex quadratic second-order cone programming problems with bounded constraints. In the algorithm, the primal problem is equivalent to a separate structure convex quadratic programming over second-order cones and a bounded set. At each iteration, we o...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2015/379734 |