Metraipolis › archive › dc_fd885c49456d

Computationally Constrained First-Order Prediction-Correction Approach for Time-Varying Convex Optimization — arXiv:2610.38820

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.38820
License (as archived)
CC0-1.0
Archived
2026-11-01T03:00:42.321Z
SHA-256 of the archived text
8d03500d88586dc365a4e19bcbb792e5af7e577a7cb9a61ff9409e5f84f60ba4
Stable URL of this page
https://metraipolis.com/documento/dc_fd885c49456d

How to cite

Computationally Constrained First-Order Prediction-Correction Approach for Time-Varying Convex Optimization — arXiv:2610.38820 — arXiv (en), https://arxiv.org/abs/2610.38820 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fd885c49456d (Metraipolis archive dc_fd885c49456d, sha256 8d03500d88586dc365a4e19bcbb792e5af7e577a7cb9a61ff9409e5f84f60ba4)
BibTeX
@misc{dcfd885c49456d,
  title = {Computationally Constrained First-Order Prediction-Correction Approach for Time-Varying Convex Optimization — arXiv:2610.38820},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.38820},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fd885c49456d; sha256 8d03500d88586dc365a4e19bcbb792e5af7e577a7cb9a61ff9409e5f84f60ba4},
  year = {2026}
}

Archived text

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

Time-varying optimization methods often predict the locations of time-varying optima, then sample the objective function being minimized, and then compute corrections to those predictions. However, those works typically do not account for settings in which computations are limited. Therefore, in this work we formulate a prediction-correction algorithm that is designed to obey constraints on the total number of iterations it can execute over a given time horizon. We first show that there is a critical threshold for the average number of computations that can be executed between samples of the objective. Then, we show that if the number of allowable computations is above this threshold, then the distance to a time-varying optimum bound decays geometrically. Next, we show that if the number of allowable computations is below that threshold, then the distance to a time-varying optimum still remains bounded. Therefore, it is still possible to track time-varying optima with bounded error even under restrictive limits on the number of computations that can be executed. We also present an algorithm to determine how many prediction and correction steps should be executed for each sample of the objective. Simulation results show that under typical conditions our approach reduces cumulative tracking error by 45.5% compared to a comparable baseline approach.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv eess.SY, nuovi lavori del giorno).
Categorie arXiv: Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2610.38820 — 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-01T02:25:30.740Z dalla pagina https://arxiv.org/list/eess.SY/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).