combinatorial optimization 1interior-point method 1primal-dual algorithm 1semidefinite programming 1tensor-train decomposition 1
From the 1 of 2 linked papers with an AI index.
2 papers
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…
cs.CV2026
VITA: Zero-Shot Value Functions via Test-Time Adaptation of Vision-Language Models
Christos Ziakas, Alessandra Russo
Vision-Language Models (VLMs) show promise as zero-shot goal-conditioned value functions, but their frozen pre-trained representations limit generalization and temporal reasoning.…