Metraipolis › archive › dc_4bd797129bd1

Convex-Concave Interpolation and Application of PEP to Bilinear-Coupled Saddle-Point Problem — arXiv:2608.11412

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.11412
License (as archived)
CC0-1.0
Archived
2026-10-19T05:44:15.032Z
SHA-256 of the archived text
e499f3d2df390f01ad2c2e90c0c473e11951d6feb5ade6488fbaf120f82c31c5
Stable URL of this page
https://metraipolis.com/documento/dc_4bd797129bd1

How to cite

Convex-Concave Interpolation and Application of PEP to Bilinear-Coupled Saddle-Point Problem — arXiv:2608.11412 — arXiv (en), https://arxiv.org/abs/2608.11412 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4bd797129bd1 (Metraipolis archive dc_4bd797129bd1, sha256 e499f3d2df390f01ad2c2e90c0c473e11951d6feb5ade6488fbaf120f82c31c5)
BibTeX
@misc{dc4bd797129bd1,
  title = {Convex-Concave Interpolation and Application of PEP to Bilinear-Coupled Saddle-Point Problem — arXiv:2608.11412},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.11412},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4bd797129bd1; sha256 e499f3d2df390f01ad2c2e90c0c473e11951d6feb5ade6488fbaf120f82c31c5},
  year = {2026}
}

Archived text

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

The Performance estimation problem (PEP) approach reformulates finding the exact worst-case performance of an algorithm as the solution to an optimization problem. Tractable formulation of the problem requires necessary and sufficient interpolation conditions. We present the interpolation conditions for convex--concave functions, bilinear functions, and composite functions with bilinear coupling. We also construct PEP for first-order methods for composite saddle-point problem.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-13 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.11412 — 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-10-19T05:39:32.135Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).