Pages that link to "Item:Q1762456"
From MaRDI portal
The following pages link to Templates for convex cone problems with applications to sparse signal recovery (Q1762456):
Displaying 50 items.
- TFOCS (Q24763) (← links)
- A second-order method for strongly convex \(\ell _1\)-regularization problems (Q263191) (← links)
- An inexact successive quadratic approximation method for L-1 regularized optimization (Q301652) (← links)
- OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
- Phase retrieval for imaging problems (Q340015) (← links)
- Tomographic image reconstruction using training images (Q344271) (← links)
- Robust sparse phase retrieval made easy (Q347523) (← links)
- Sparse microwave imaging: principles and applications (Q362310) (← links)
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms (Q368722) (← links)
- A distributed algorithm for fitting generalized additive models (Q402192) (← links)
- Implementation of an optimal first-order method for strongly convex total variation regularization (Q438730) (← links)
- Inexact proximal Newton methods for self-concordant functions (Q522088) (← links)
- Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← links)
- A tensor-based dictionary learning approach to tomographic image reconstruction (Q727901) (← links)
- Analysis of sparse MIMO radar (Q741258) (← links)
- A fast splitting method tailored for Dantzig selector (Q887167) (← links)
- SLOPE-adaptive variable selection via convex optimization (Q902886) (← links)
- Nonparametric operator-regularized covariance function estimation for functional data (Q1615269) (← links)
- Finding Dantzig selectors with a proximity operator based fixed-point algorithm (Q1663200) (← links)
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector (Q1686207) (← links)
- Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
- Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery (Q1701931) (← links)
- Accelerated first-order methods for hyperbolic programming (Q1717219) (← links)
- Convergence of first-order methods via the convex conjugate (Q1728354) (← links)
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization (Q1734766) (← links)
- A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
- The matrix completion method for phase retrieval from fractional Fourier transform magnitudes (Q1793188) (← links)
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization (Q1799934) (← links)
- An alternating direction method for finding Dantzig selectors (Q1927184) (← links)
- TILT: transform invariant low-rank textures (Q1931595) (← links)
- Accelerated linearized Bregman method (Q1945379) (← links)
- Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework (Q1950814) (← links)
- A partially proximal linearized alternating minimization method for finding Dantzig selectors (Q1983897) (← links)
- A global sparse gradient based coupled system for image denoising (Q2004434) (← links)
- On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems (Q2010091) (← links)
- A general self-adaptive relaxed-PPA method for convex programming with linear constraints (Q2015595) (← links)
- Robust budget allocation via continuous submodular functions (Q2019911) (← links)
- Acceleration of primal-dual methods by preconditioning and simple subproblem procedures (Q2027970) (← links)
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions (Q2028458) (← links)
- A dual reformulation and solution framework for regularized convex clustering problems (Q2029898) (← links)
- Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval (Q2052715) (← links)
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems (Q2082554) (← links)
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
- A Newton Frank-Wolfe method for constrained self-concordant minimization (Q2141726) (← links)
- New preconditioners applied to linear programming and the compressive sensing problems (Q2226494) (← links)
- PRP-like algorithm for monotone operator equations (Q2231600) (← links)
- A significance test for the lasso (Q2249837) (← links)
- Discussion: ``A significance test for the lasso'' (Q2249838) (← links)
- Rejoinder: ``A significance test for the lasso'' (Q2249839) (← links)
- Robust subspace clustering (Q2249846) (← links)
