Metraipolis › archive › dc_d503219fb561

The method of ellipcenters with momentum and relaxation for convex quadratic minimization — arXiv:2608.29454

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.29454
License (as archived)
CC0-1.0
Archived
2026-10-17T09:02:50.665Z
SHA-256 of the archived text
1a9096475e56b277d83ad61544461d638719371dab52391684aa7ba5c34c1744
Stable URL of this page
https://metraipolis.com/documento/dc_d503219fb561

How to cite

The method of ellipcenters with momentum and relaxation for convex quadratic minimization — arXiv:2608.29454 — arXiv (en), https://arxiv.org/abs/2608.29454 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d503219fb561 (Metraipolis archive dc_d503219fb561, sha256 1a9096475e56b277d83ad61544461d638719371dab52391684aa7ba5c34c1744)
BibTeX
@misc{dcd503219fb561,
  title = {The method of ellipcenters with momentum and relaxation for convex quadratic minimization — arXiv:2608.29454},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.29454},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d503219fb561; sha256 1a9096475e56b277d83ad61544461d638719371dab52391684aa7ba5c34c1744},
  year = {2026}
}

Archived text

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

The method of ellipcenters (ME) is a recent technique developed for unconstrained minimization. Its iteration relies only on first order information and consists of building a suitable two-dimensional ellipse that tries to capture intrinsic ill-conditioning of the problem. The center of the ellipse is taken as the next iterate, which justifies the name of the method. ME was already shown to converge linearly when the objective function is smooth and strongly convex. The special case when the objective is quadratic was studied in the first paper on ME and is also the subject of our work here. In this paper, we propose two variants of ME: RelaxME which adds in ME an additional relaxation step at each iteration and MomME which embeds momentum in ME. We prove linear convergence of RelaxME and MomME and, in particular, we show convergence of RelaxME and MomME (and also of ME) in one iteration when the matrix of the quadratic form has only two distinct eigenvalues. Finally, we provide the results of numerical experiments which compare on five optimization problems (and different combinations of parameters defining these problems) ME, RelaxME, and MomME, with 3 other optimizers: the conjugate gradient method [10], Barzilai and Borwein gradient method with long step [2], and the gradient method with adaptive spectral step length [7]. On most instances, MomME provides the smallest number of iterations and conjugate gradient and MomME provide the smallest CPU times and similar CPU times. This opens optimistic possibilities for ME with momentum in broader settings.

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