Metraipolis › archive › dc_024c0e5e01d6

Certificate-Coupled DCA for the Trust-Region Subproblem: Early Structural Escape and Progressive Global Certification — arXiv:2610.00172

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.00172
License (as archived)
CC0-1.0
Archived
2026-10-06T15:59:50.443Z
SHA-256 of the archived text
fea6d0077603c4520eaa8d3d253faddb169985240f81fce401f04f9c17755250
Stable URL of this page
https://metraipolis.com/documento/dc_024c0e5e01d6

How to cite

Certificate-Coupled DCA for the Trust-Region Subproblem: Early Structural Escape and Progressive Global Certification — arXiv:2610.00172 — arXiv (en), https://arxiv.org/abs/2610.00172 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_024c0e5e01d6 (Metraipolis archive dc_024c0e5e01d6, sha256 fea6d0077603c4520eaa8d3d253faddb169985240f81fce401f04f9c17755250)
BibTeX
@misc{dc024c0e5e01d6,
  title = {Certificate-Coupled DCA for the Trust-Region Subproblem: Early Structural Escape and Progressive Global Certification — arXiv:2610.00172},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.00172},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_024c0e5e01d6; sha256 fea6d0077603c4520eaa8d3d253faddb169985240f81fce401f04f9c17755250},
  year = {2026}
}

Archived text

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

We study the nonconvex trust-region subproblem by a certificate-coupled difference-of-convex algorithm that incorporates spectral information before exact first-order stationarity is attained. The method maintains a persistent randomized Krylov subspace together with the DCA iterates. Near stationarity, a sufficiently negative shifted Rayleigh quotient yields an explicit feasible correction with a quantitative decrease in the objective value; otherwise, completion of a prescribed Lanczos depth provides, with high probability, an approximate positive-semidefiniteness certificate. The same Krylov subspace also provides a certified upper bound on the largest eigenvalue for selecting the DC curvature parameter at subsequent accuracy stages. We prove a uniform negative-curvature correction result over the trust region, covering the near-orthogonal hard-case regime, together with finite-termination and work bounds at fixed tolerances and a quantitative objective-gap certificate. Under a progressive accuracy schedule, the certified objective values converge to the global optimum and the iterates converge in distance to the global solution set, while the Krylov subspace is retained across corrections and accuracy stages. Numerical experiments illustrate the phenomena established by the analysis: negative-curvature corrections can occur before the corresponding post-convergence spectral corrections, the quantitative decrease bound is satisfied in all tested near-orthogonal instances, and retaining the Krylov subspace reduces the median number of spectral matrix-vector products by approximately a factor of $2.6$ relative to restarting the spectral process in the controlled comparison.

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