Projection and contraction methods for semidefmite programming

Applied Mathematics and Computation

Volumn 95, Issue 2-3, 1998, Pages 275-289

  Han, Qiaoming ^a  

^a INSTITUTE OF APPLIED MATHEMATICS   (China)

Author keywords

Linear programming; Projection and contraction method; Projection equation; Semidefinite programming

Indexed keywords

EID: 16444380352     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-3003(97)10113-8     Document Type: Article

References (15)

1. Alizadeh, F., 1995. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5, 13-51.
2. Fletcher, R., 1985. Semidefinite matrix constraints in optimization. SIAM J. Control Optim. 23, 493-513.
3. Glunt, W., 1995. An alternating projections method for certain linear problems in a Hubert space. IMA J. Numer. Anal. 15, 291-305.
4. Harker, P.T., Pang, J.S., 1990. Finite dimensional variational inequality and nonlinear complementary problems: A survey of theory, algorithms and applications. Math. Programming 48, 161-220.
5. He, B.S., 1992. A projection and contraction method for a class of linear complementarity problem and its application in convex quadratic programming. Appl. Math. Optim. 25, 247-262.
6. He, B.S., 1994a. A new method for a class of linear variational inequalities. Math. Programming 66, 137-144.
7. He, B.S., 1994b. Solving a class of linear projection equations. Numerische Mathematik 68, 71-80.
8. He, B.S., 1996. A modified projection and contraction method for a class of linear complementarity problems. J. Comput. Math. 14, 54-63.
9. He, B.S., de Klerk, E., Roos, C, Jerlaky, 1996. Method of approximate center for semidefinite programming. Technical Report 96-27. Reports of the Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands.
10. Luenberger, D.G., 1973. Introduction to Linear and Nonlinear Programming. Addison-Wesley, Reading, MA.
11. Nesterov, Y., Nemitovskii, A.S., 1994. Interior point polynomial algorithms in convex programming. SIAM Studies in Applied Mathematics, vol. 13, SIAM, Philadelphia, USA.
12. Overton, M., 1988. On minimizing the maximum eigenvalue of a symmetric matrix. SIAM J. Matrix Anal. Appl. 9, 256-268.
13. Schrijver, A., 1986. Theory of Linear and Integer Programming. Wiley, New York.
14. Vanderberghe, L., 1996. Semidefinite programming. SIAM Rev. 38, 49-95.
15. Vanderberghe, L., Boyd, S., 1995. A primal-dual potential reduction algorithm for problems involving matrix inequalities. Math. Programming 69, 205-236.