Projection and contraction methods for semidefinite programming

Projection and contraction methods for semidefinite programming

0.00 Avg rating0 Votes
Article ID: iaor20011524
Country: United States
Volume: 95
Issue: 2/3
Start Page Number: 275
End Page Number: 289
Publication Date: Sep 1998
Journal: Applied Mathematics and Computation
Authors:
Keywords: semidefinite programming
Abstract:

Recently, He presented some iterative projection and contraction (PC) methods for linear variational inequalities. Its simplicity, robustness and ability to handle large problems has attracted a lot of attention. This paper extends the PC methods from linear programming to semidefinite programming (SDP). The SDP problem is transformed into an equivalent projection equation, which is solved by PC methods. Some promising numerical results obtained from a preliminary implementation are included.

Reviews

Required fields are marked *. Your email address will not be published.