An efficient regularized PR splitting type algorithm for two-block nonconvex linear constrained programs in \(\ell_{1 / 2}\) regularized compressed sensing problems (Q6591534)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient regularized PR splitting type algorithm for two-block nonconvex linear constrained programs in \(\ell_{1 / 2}\) regularized compressed sensing problems |
scientific article; zbMATH DE number 7900348
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient regularized PR splitting type algorithm for two-block nonconvex linear constrained programs in \(\ell_{1 / 2}\) regularized compressed sensing problems |
scientific article; zbMATH DE number 7900348 |
Statements
An efficient regularized PR splitting type algorithm for two-block nonconvex linear constrained programs in \(\ell_{1 / 2}\) regularized compressed sensing problems (English)
0 references
22 August 2024
0 references
Kurdyka-Łojasiewicz inequality
0 references
Peaceman-Rachford splitting method
0 references
nonconvex program
0 references
convergence
0 references
0 references
0 references
0 references
