
arXiv: 2301.06368
Abstract We propose an interior point method (IPM) for solving semidefinite programming problems (SDPs). The standard interior point algorithms used to solve SDPs work in the space of positive semidefinite matrices. Contrary to that the proposed algorithm works in the cone of matrices of constant factor width. We prove global convergence and provide a complexity analysis. Our work is inspired by a series of papers by Ahmadi, Dash, Majumdar and Hall, and builds upon a recent preprint by Roig-Solvas and Sznaier [arXiv:2202.12374, 2022].
Conic optimization, factor width cone, Convex programming, interior point methods, Interior-point methods, semidefinite programming, Factor width cone, conic optimization, Optimization and Control (math.OC), FOS: Mathematics, Semidefinite programming, Interior point methods, Mathematics - Optimization and Control
Conic optimization, factor width cone, Convex programming, interior point methods, Interior-point methods, semidefinite programming, Factor width cone, conic optimization, Optimization and Control (math.OC), FOS: Mathematics, Semidefinite programming, Interior point methods, Mathematics - Optimization and Control
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
