works on
combinatorial optimization 1interior-point method 1primal-dual algorithm 1semidefinite programming 1tensor-train decomposition 1

From the 1 of 1 linked paper with an AI index.

collaborators

1 paper

math.OC2026

An Inexact Tensor-Train Primal-Dual Interior-Point Method for Semidefinite Programs

Frederik Kelbel, Sergey Dolgov, Dante Kalise +1

The paper proposes a primal‑dual interior‑point algorithm that uses tensor‑train decompositions to efficiently solve large semidefinite programs, providing convergence analysis and…