Metraipolis › archive › dc_607c7ea5ad71

Regularized coordinate minimization for nonconvex composite optimization with application to quantized image compression — arXiv:2609.06260

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.06260
License (as archived)
CC0-1.0
Archived
2026-10-16T14:24:02.879Z
SHA-256 of the archived text
2580b508c0ae29e748bb9ff382e81c21907d929458f5d0cdf0de7fc9473941ae
Stable URL of this page
https://metraipolis.com/documento/dc_607c7ea5ad71

How to cite

Regularized coordinate minimization for nonconvex composite optimization with application to quantized image compression — arXiv:2609.06260 — arXiv (en), https://arxiv.org/abs/2609.06260 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_607c7ea5ad71 (Metraipolis archive dc_607c7ea5ad71, sha256 2580b508c0ae29e748bb9ff382e81c21907d929458f5d0cdf0de7fc9473941ae)
BibTeX
@misc{dc607c7ea5ad71,
  title = {Regularized coordinate minimization for nonconvex composite optimization with application to quantized image compression — arXiv:2609.06260},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.06260},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_607c7ea5ad71; sha256 2580b508c0ae29e748bb9ff382e81c21907d929458f5d0cdf0de7fc9473941ae},
  year = {2026}
}

Archived text

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

This paper presents a regularized cyclic coordinate minimization method for solving nonconvex composite optimization problems having the objective function formed as the sum of two terms, one is twice continuously differentiable and the second term is simple and separable. We analyze the convergence behaviour of our coordinate minimization method, in particular we provide convergence rates to a first-order optimality criterion and objective residual depending on the assumptions on the problem. Then, we show that our algorithmic framework can be efficiently applied for solving quantized matrix factorization problems that arise in e.g., lossy image compression. More specifically, on KODAK and CLIC 2024 datasets, our method notably outperforms JPEG at low bit rates, achieving savings in bits per pixel without excessive degradation and remains comparable at higher bit rates. Moreover, we evaluate both the original and quantized compressed images in a classification task using 3 well-known convolutional networks AlexNet, ResNet50 and MobileNetV2 based on floating point and integer arithmetic representations. Remarkably, when comparing the two numerical representations of the convolutional networks, there is no substantially accuracy degradation on ImageNet dataset. The numerical results on image compression and classification using real data show the flexibility and efficiency of our algorithm compared to well-established methods from the literature.

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