An Interior Point Method for Solving Semidefinite Programs Using Cutting Planes and Weighted Analytic Centers

John Machacek and Shafiu Jibrin

Journal of Applied Mathematics, 2012, vol. 2012, issue 1

Abstract: We investigate solving semidefinite programs (SDPs) with an interior point method called SDP‐CUT, which utilizes weighted analytic centers and cutting plane constraints. SDP‐CUT iteratively refines the feasible region to achieve the optimal solution. The algorithm uses Newton’s method to compute the weighted analytic center. We investigate different stepsize determining techniques. We found that using Newton′s method with exact line search is generally the best implementation of the algorithm. We have also compared our algorithm to the SDPT3 method and found that SDP‐CUT initially gets into the neighborhood of the optimal solution in less iterations on all our test problems. SDP‐CUT also took less iterations to reach optimality on many of the problems. However, SDPT3 required less iterations on most of the test problems and less time on all the problems. Some theoretical properties of the convergence of SDP‐CUT are also discussed.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2012/946893

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2012:y:2012:i:1:n:946893

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().