Galerkin alternating-direction method for a kind of second-order quasi-linear hyperbolic problems

2007 ◽  
Vol 189 (2) ◽  
pp. 1304-1319 ◽  
Author(s):  
X. Lai ◽  
Yirang Yuan
2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Xuewen Mu ◽  
Yaling Zhang

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 only need to compute the metric projection onto the second-order cones and the projection onto the bound set. The result of convergence is given. Numerical results demonstrate that our method is efficient for the convex quadratic second-order cone programming problems with bounded constraints.


Sign in / Sign up

Export Citation Format

Share Document