A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion

A new relaxed variant of interior point method for low-rank semidefinite programming problems is proposed in this paper. The method is a step outside of the usual interior point framework. In anticipation to converging to a low-rank primal solution, a special nearly low-rank form of all primal itera...

Descripción completa

Detalles Bibliográficos
Autores principales: Bellavia, Stefania, Gondzio, Jacek, Porcelli, Margherita
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2021
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8504795/
https://www.ncbi.nlm.nih.gov/pubmed/34658507
http://dx.doi.org/10.1007/s10915-021-01654-1

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8504795/
https://www.ncbi.nlm.nih.gov/pubmed/34658507
http://dx.doi.org/10.1007/s10915-021-01654-1

Ejemplares similares