Solving semidefinite programming problems via alternating direction methods

Journal of Computational and Applied Mathematics

Volumn 193, Issue 2, 2006, Pages 437-445

  Yu, Zhensheng ^a  

^a UNIVERSITY OF SHANGHAI FOR SCIENCE AND TECHNOLOGY   (China)

Author keywords

Alternating direction method; Optimality condition; Projection equation; Semidefinite programming

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; LINEAR EQUATIONS; LINEAR SYSTEMS; PROBLEM SOLVING;

ALTERNATING DIRECTION METHOD; OPTIMALITY CONDITION; PROJECTION EQUATION; SEMIDEFINITE PROGRAMMING;

COMPUTER PROGRAMMING;

EID: 33646233993     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2005.07.002     Document Type: Article

References (23)

1. Alizadeh F. Interior point methods in semidefinite programming with application to combinatorial optimization. SIAM J. Optim. 5 (1995) 13-51
2. Alizadeh F., Haeberly J.P.A., and Overton M.L. Primal-dual interior point methods for semidefinite programming: convergence rates, stability and numerical result. SIAM J. Optim. 8 (1998) 746-768
3. Fortin M., and Glowinski R. Augmented Lagrangian Methods: Application to the Solution of Boundary-valued Problems (1983), North-Holland, Amsterdam
4. Gabay D., and Mercier B. A dual algorithm for the solution of nonlinear variational problems via finite-element approximations. Comput. Math. Appl. 2 (1976) 17-40
5. Glowinski R. Numerical Methods for Nonlinear Variational Problems (1984), Springer, New York
6. Han Q.M. Projection and contraction methods for semidefinite programming. Appl. Math. Comput. 95 (1998) 275-289
7. He B.S. A new method for a class of linear variational inequalities. Math. Programming 66 (1994) 137-144
8. He B.S. Solving a class of linear projection equation. Numer. Math. 68 (1994) 71-80
9. He B.S., Liao L.Z., Han D.R., and Yang H. A new inexact alternating directions method for monotone variational inequality. Math. Programming 92 (2002) 103-118
10. He B.S., and Zhou J. A modified alternating direction for convex minimization problems. Appl. Math. Lett. 13 (2000) 123-130
11. Helebery C., Rendl F., Vanderbei R., and Wolkowicz H. An interior point method for semidefinite programming. SIAM J. Optim. 6 (1996) 342-361
12. Kanzow C., and Nagel C. Semidefinite programming: new search direction, smoothing-type methods and numerical results. SIAM J. Optim. 13 (2002) 1-23
13. M. Kojima, M. Shida, S. Shindoh, Global and local convergence of predictor-corrector infeasible interior point algorithm for semidefinite programming problems, Research Reports on Information Science B-305, Department of Information Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152, Japan, 1995.
14. Kojima M., Shindoh S., and Hara S. Interior point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 7 (1997) 86-125
15. Luenberger D.G. Introduction to Linear and Nonlinear Programming (1973), Addison-Wesley, Reading, MA
16. Monteiro R.D.C. Primal-dual path following algorithms for semidefinite programming. SIAM J. Optim. 7 (1997) 663-678
17. Nesterov Y., and Nemirovskii A. Interior Point Polynomial Algorithm in Convex Programming (1994), SIAM, Philadelphia, PA
18. Potra F.A., and Sheng R.Q. A superlinearly convergent primal-dual infeasible interior point algorithm for semidefinite programming. SIAM J. Optim. 8 (1998) 1007-1028
19. Tseng P. Merit function for semidefinite complementarity problems. Math. Programming 83 (1998) 159-185
20. Vandenberghe L., and Boyd S. Semidefinite programming. SIAM Rev. 38 (1996) 49-95
21. Wang S.L., Yang H., and He B.S. Solving a class of asymmetric variational inequalities by a new alternating direction method. Comput. Math. Appl. 40 (2000) 927-937
22. H. Wolkowicz, R. Saigal, L. Vandenberghe (Eds.), Handbook of Semidefinite Programming: Theory, Algorithm, and Application, Kluwer Academic Publishers, Boston, MA, 2000, xxvi+654pp.
23. Zhang Y. On extending some interior point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8 (1998) 365-386