Sciweavers

Share
SIAMJO
2002

Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results

10 years 11 months ago
Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
Motivated by some results for linear programs and complementarity problems, this paper gives some new characterizations of the central path conditions for semidefinite programs. Exploiting these characterizations, some smoothing-type methods for the solution of semidefinite programs are derived. The search directions generated by these methods are automatically symmetric, and the overall methods are shown to be globally and locally superlinearly convergent under suitable assumptions. Some numerical results are also included which indicate that the proposed methods are very promising and comparable to several interior-point methods. Moreover, the current method seems to be superior to the recently proposed smoothing method by Chen and Tseng [8]. Key Words. Semidefinite programs, smoothing-type methods, Newton's method, global convergence, superlinear convergence.
Christian Kanzow, Christian Nagel
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where SIAMJO
Authors Christian Kanzow, Christian Nagel
Comments (0)
books