Abstract

Mehrotra type primal-dual predictor-corrector interior-point algorithms for semidefinite programming are implemented, using the homogeneous formulation proposed and analyzed by Potra and Sheng. Several search directions, including the AHO, HKM, NT, Toh, and Gu directions, are used. A rank-2 update technique is employed in our MATLAB code so that the computation of homogeneous directions is only slightly more expensive than in the non-homogeneous case. However, the homogeneous algorithms generally take fewer iterations to compute an approximate solution within a desired accuracy. Numerical results show that the homogeneous algorithms outperform their non-homogeneous counterparts, with improvement of more than 20% in many cases, in terms of total CPU time.

Keywords

HomogeneousMATLABSemidefinite programmingAlgorithmInterior point methodRank (graph theory)Computer sciencePoint (geometry)MathematicsMathematical optimizationCombinatoricsGeometry

Affiliated Institutions

Related Publications

Publication Info

Year
1999
Type
article
Volume
11
Issue
1-4
Pages
583-596
Citations
21
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

21
OpenAlex

Cite This

Nathan W. Brixius, Florian A. Potra, Rongqin Sheng (1999). Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming. Optimization methods & software , 11 (1-4) , 583-596. https://doi.org/10.1080/10556789908805763

Identifiers

DOI
10.1080/10556789908805763