Metraipolis › archive › dc_f2c1aae9ca07

Accelerated primal-dual dynamics and algorithms for convex optimization with nonlinear inequality constraints — arXiv:2609.01415

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.01415
License (as archived)
CC0-1.0
Archived
2026-10-17T07:03:30.695Z
SHA-256 of the archived text
61c1648af6edadb8b9d161de876b7f198c5d6b17250682d70af9e94f5dd7ffb3
Stable URL of this page
https://metraipolis.com/documento/dc_f2c1aae9ca07

How to cite

Accelerated primal-dual dynamics and algorithms for convex optimization with nonlinear inequality constraints — arXiv:2609.01415 — arXiv (en), https://arxiv.org/abs/2609.01415 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f2c1aae9ca07 (Metraipolis archive dc_f2c1aae9ca07, sha256 61c1648af6edadb8b9d161de876b7f198c5d6b17250682d70af9e94f5dd7ffb3)
BibTeX
@misc{dcf2c1aae9ca07,
  title = {Accelerated primal-dual dynamics and algorithms for convex optimization with nonlinear inequality constraints — arXiv:2609.01415},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.01415},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f2c1aae9ca07; sha256 61c1648af6edadb8b9d161de876b7f198c5d6b17250682d70af9e94f5dd7ffb3},
  year = {2026}
}

Archived text

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

We consider convex optimization with nonlinear inequality constraints and develop a primal-dual multiplier framework that is consistent in continuous and discrete time. We first propose continuous-time dynamics with Nesterov-type vanishing damping $\alpha/t$, together with compatible extrapolations of the dual variable and the nonlinear constraint mapping. Under convexity assumptions and $\alpha\geq3$, we establish $\mathcal O(t^{-2})$ convergence rates for both nonlinear feasibility and the objective residual. In the noncritical regime $\alpha>3$, with an admissible choice of the extrapolation parameter, we further prove that the entire primal-dual trajectory converges to a KKT pair and sharpen both continuous-time estimates to $o(t^{-2})$. We then derive an inexact accelerated primal-dual algorithm through a compatible discretization of a perturbed version of the dynamic. For composite convex objectives, a weighted summability condition on the primal inexactness yields $\mathcal O(k^{-2})$ rates for feasibility and the objective residual. In the corresponding noncritical regime, the discrete primal-dual sequence converges to a KKT pair and both residual estimates improve to $o(k^{-2})$. Thus the continuous and discrete results exhibit matching accelerated rates and matching asymptotic improvements. To the best of our knowledge, this is the first Nesterov-type primal-dual multiplier framework for convex optimization with nonlinear inequality constraints.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-02 in math.OC).
Categorie arXiv: Optimization and Control (math.OC) ; Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.01415 — 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-17T06:49:55.536Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).