Metraipolis › archive › dc_96917fe580cc

A Triangular Log-Det PDHG for Semidefinite Programming: Complementarity Selection and Global Linear Convergence — arXiv:2611.03638

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03638
License (as archived)
CC0-1.0
Archived
2026-11-03T11:32:36.481Z
SHA-256 of the archived text
59cbb573d912737b97ab3424682439f3aa00619d50643c165d1b975aeeac613d
Stable URL of this page
https://metraipolis.com/documento/dc_96917fe580cc

How to cite

A Triangular Log-Det PDHG for Semidefinite Programming: Complementarity Selection and Global Linear Convergence — arXiv:2611.03638 — arXiv (en), https://arxiv.org/abs/2611.03638 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_96917fe580cc (Metraipolis archive dc_96917fe580cc, sha256 59cbb573d912737b97ab3424682439f3aa00619d50643c165d1b975aeeac613d)
BibTeX
@misc{dc96917fe580cc,
  title = {A Triangular Log-Det PDHG for Semidefinite Programming: Complementarity Selection and Global Linear Convergence — arXiv:2611.03638},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03638},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_96917fe580cc; sha256 59cbb573d912737b97ab3424682439f3aa00619d50643c165d1b975aeeac613d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03638. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Semidefinite programming (SDP) is an important class of convex optimization problems with wide applications in practice. In this paper, we study a solution-selection question for first-order methods for solving SDPs: Can a first-order method provably select a strictly complementary solution when one exists, and a maximally complementary solution otherwise? We propose Triangular Log-Det PDHG (TriLog-PDHG), a primal-dual hybrid gradient method equipped with a triangular log-determinant Bregman kernel. We show that TriLog-PDHG converges to a KKT point for any fixed positive shift and to a maximally complementary solution for every sufficiently small positive shift. When a strictly complementary solution exists, the unshifted method provably selects a strictly complementary KKT point and enjoys a global linear convergence rate. Under the same condition, we further develop an averaged and adaptively restarted variant that accelerates convergence. Numerical experiments on classical examples and SDPLIB instances illustrate the complementarity-selection and convergence properties predicted by the theory.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2611.03638 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:04:22.291Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).