Pages that link to "Item:Q1928276"

The following pages link to The convex geometry of linear inverse problems (Q1928276):

Displaying 50 items.

• Structured Sparsity: Discrete and Convex Approaches (Q3460840) (← links)
• (Q3776909) (← links)
• Low-Rank Inducing Norms with Optimality Interpretations (Q4554068) (← links)
• Optimization Methods for Synthetic Aperture Radar Imaging (Q4556980) (← links)
• A Tight Bound of Hard Thresholding (Q4558539) (← links)
• On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems (Q4571884) (← links)
• Multicompartment magnetic resonance fingerprinting (Q4582674) (← links)
• Fast and Reliable Parameter Estimation from Nonlinear Observations (Q4588858) (← links)
• Robust analysis ℓ₁-recovery from Gaussian measurements and total variation minimization (Q4594564) (← links)
• A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization (Q4600841) (← links)
• Guarantees of total variation minimization for signal recovery (Q4603592) (← links)
• Model selection with low complexity priors (Q4603697) (← links)
• Time for dithering: fast and quantized random embeddings via the restricted isometry property (Q4603715) (← links)
• High-dimensional estimation with geometric constraints: Table 1. (Q4603716) (← links)
• Super-resolution radar (Q4603731) (← links)
• Convex geometry of quantum resource quantification (Q4606166) (← links)
• Stable low-rank matrix recovery via null space properties (Q4606522) (← links)
• Modular proximal optimization for multidimensional total-variation regularization (Q4614088) (← links)
• Polynomial Norms (Q4620456) (← links)
• Multichannel blind deconvolution via maximum likelihood estimator: application in neural recordings (Q4625203) (← links)
• (Q4633013) (← links)
• Generalized Conditional Gradient for Sparse Estimation (Q4637076) (← links)
• Regularization and the small-ball method II: complexity dependent error rates (Q4637079) (← links)
• Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions on General Weighted Graphs (Q4689639) (← links)
• A Data-Independent Distance to Infeasibility for Linear Conic Systems (Q4959838) (← links)
• Semidefinite Representations of Gauge Functions for Structured Low-Rank Matrix Decomposition (Q4976156) (← links)
• Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems (Q4986411) (← links)
• A Derivative-Free Method for Structured Optimization Problems (Q4987276) (← links)
• Matrix completion and related problems via strong duality (Q4993268) (← links)
• One-bit compressed sensing via <i> <b>ℓ</b> </i> _<i>p</i>(<b>0</b> <b>&lt;</b> <i>p</i> <b>&lt;</b> <b>1</b>)-minimization method (Q5000599) (← links)
• Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing (Q5020144) (← links)
• An Epigraphical Approach to the Representer Theorem (Q5026403) (← links)
• WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions (Q5043741) (← links)
• (Q5054626) (← links)
• On the universality of noiseless linear estimation with respect to the measurement matrix (Q5061337) (← links)
• Identifying 3D Genome Organization in Diploid Organisms via Euclidean Distance Geometry (Q5065472) (← links)
• Dimension-free bounds for largest singular values of matrix Gaussian series (Q5079951) (← links)
• Methods for Sparse and Low-Rank Recovery under Simplex Constraints (Q5109909) (← links)
• TV-based reconstruction of periodic functions (Q5132274) (← links)
• Persistent homology for low-complexity models (Q5160778) (← links)
• Computational and statistical tradeoffs via convex relaxation (Q5170958) (← links)
• Living on the edge: phase transitions in convex programs with random data (Q5177869) (← links)
• (Q5214187) (← links)
• Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains (Q5222093) (← links)
• Graphical Model Selection for Gaussian Conditional Random Fields in the Presence of Latent Variables (Q5231501) (← links)
• On Representer Theorems and Convex Regularization (Q5231664) (← links)
• Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods (Q5231667) (← links)
• A Convex Approach to Superresolution and Regularization of Lines in Images (Q5236638) (← links)
• A Simple Tool for Bounding the Deviation of Random Matrices on Geometric Sets (Q5278301) (← links)
• Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems (Q5347292) (← links)