arXiv (All)
open access
Regularized coordinate minimization for nonconvex composite optimization with application to quantized image compression
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Structural zoom for linear composite materials based on adaptive mesh and homogenization#280534
- A projected descent method for minimization of weakly semismooth functions over polyhedral sets#1131124
- Conservation of Normalized Energy Density in multi-layered media: a proof for the general multi-layer 2D SH problem#973540
- Multitrace formulations and Domain Decomposition Methods for the solution of Helmholtz transmission problems for bounded composite scatterers#1050709
- Shape optimization using the least squares method#488743
Record · ID 973853
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive