Email this article A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem
- Authors: Zhadan V.G.1
-
Affiliations:
- Dorodnicyn Computing Center
- Issue: Vol 56, No 7 (2016)
- Pages: 1220-1237
- Section: Article
- URL: https://journal-vniispk.ru/0965-5425/article/view/178553
- DOI: https://doi.org/10.1134/S0965542516070186
- ID: 178553
Cite item
Open Access
Access granted
Subscription Access
Abstract
The linear semidefinite programming problem is considered. The dual affine scaling method in which all current iterations belong to the feasible set is proposed for its solution. Moreover, the boundaries of the feasible set may be reached. This method is a generalization of a version of the affine scaling method that was earlier developed for linear programs to the case of semidefinite programming.
About the authors
V. G. Zhadan
Dorodnicyn Computing Center
Author for correspondence.
Email: zhadan@ccas.ru
Russian Federation, ul. Vavilova 40, Moscow, 119333
Supplementary files
