Two-phase simplex method for linear semidefinite optimization
- 96 Downloads
The linear semidefinite programming problem is considered. To solve it, the variant of the primal simplex method, that generalizes the corresponding method for linear programming problems, is proposed. The passage from one extreme point of the feasible set to another one is described. The main attention is given to pivoting in the case, when the extreme point is irregular, i.e. the “triangular” number of rank of the matrix in the basic point is less than number of equality type constraints in the problem. The approach for finding a starting extreme point is proposed too. The local convergence of the method is proven.
KeywordsLinear semidefinite programming Extreme points Primal simplex method Two-phase method Local convergence
This work was supported by the Russian Foundation for Basic Research (Project No. 17-07-00510).
- 2.Eremin, I.I.: Theory of Linear Optimization. Izd. “Yekaterinburg”, Ekaterinburg (1999). (in Russian) Google Scholar
- 5.Anjos, M.F., Lasserre, J.B. (eds.): Handbook on Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications. Springer, New York (2011)Google Scholar
- 9.Kosolap, A.I.: The simplex method for semidefinite programming problems. Vest. Donetsk Nats. Univ. Ser. Estestv. Nauki 2, 365–369 (2009). (in Russian)Google Scholar
- 14.Zhadan, V.G.: On a variant of the affine scaling method for linear semidefinite programming. Tr. Inst. Mat. Mekh. UrO RAN 20(3), 145–160 (2014). (in Russian)Google Scholar
- 19.Zhadan, V.G.: A variant of dual simplex method for linear semidefinite programming problem. Tr. Inst. Mat. Mekh. UrO RAN 22(3), 90–100 (2016). (in Russian)Google Scholar