Iterative hard thresholding methods for \(l_0\) regularized convex cone programming (Q463721): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
The author presents an iterative hard thresholding (IHT) method and its variant for solving a special \(l_0\) regularized box constrained convex programming. The iteration complexity of the IHT method for finding an \(\epsilon\)-local-optimal solution of the problem is obtained. Furthermore, the author develops a method for solving \(l_0\) regularized convex cone programming by applying the IHT method to its quadratic penalty relation and establishes its iteration complexity for finding an \(\epsilon\)-approximate local minimizer of the problem. | |||
Property / review text: The author presents an iterative hard thresholding (IHT) method and its variant for solving a special \(l_0\) regularized box constrained convex programming. The iteration complexity of the IHT method for finding an \(\epsilon\)-local-optimal solution of the problem is obtained. Furthermore, the author develops a method for solving \(l_0\) regularized convex cone programming by applying the IHT method to its quadratic penalty relation and establishes its iteration complexity for finding an \(\epsilon\)-approximate local minimizer of the problem. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C25 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6357715 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
sparse approximation | |||
Property / zbMATH Keywords: sparse approximation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
iterative hard thresholding method | |||
Property / zbMATH Keywords: iterative hard thresholding method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(l_0\) regularization | |||
Property / zbMATH Keywords: \(l_0\) regularization / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
box constrained convex programming | |||
Property / zbMATH Keywords: box constrained convex programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
convex cone programming | |||
Property / zbMATH Keywords: convex cone programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
iteration complexity | |||
Property / zbMATH Keywords: iteration complexity / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Guo-Qiang Wang / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963292690 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1211.0056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Greedy Sparsity-Constrained Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-Point Step Size Gradient Methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iterative thresholding for sparse approximations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iterative hard thresholding for compressed sensing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Compressed sensing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hard Thresholding Pursuit: An Algorithm for Compressive Sensing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iteration-complexity of first-order penalty methods for convex programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sparse Approximation via Penalty Decomposition Methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching pursuits with time-frequency dictionaries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Normalized Iterative Hard Thresholding for Matrix Completion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Greed is Good: Algorithmic Results for Sparse Approximation / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:02, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Iterative hard thresholding methods for \(l_0\) regularized convex cone programming |
scientific article |
Statements
Iterative hard thresholding methods for \(l_0\) regularized convex cone programming (English)
0 references
17 October 2014
0 references
The author presents an iterative hard thresholding (IHT) method and its variant for solving a special \(l_0\) regularized box constrained convex programming. The iteration complexity of the IHT method for finding an \(\epsilon\)-local-optimal solution of the problem is obtained. Furthermore, the author develops a method for solving \(l_0\) regularized convex cone programming by applying the IHT method to its quadratic penalty relation and establishes its iteration complexity for finding an \(\epsilon\)-approximate local minimizer of the problem.
0 references
sparse approximation
0 references
iterative hard thresholding method
0 references
\(l_0\) regularization
0 references
box constrained convex programming
0 references
convex cone programming
0 references
iteration complexity
0 references
0 references
0 references