Pages that link to "Item:Q150994"

The following pages link to A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems (Q150994):

Displaying 50 items.

• A projection method on measures sets (Q515908) (← links)
• Incremental projection approach of regularization for inverse problems (Q517924) (← links)
• Parallel Nesterov's method for large-scale minimization of partially separable functions (Q519774) (← links)
• An inexact alternating direction method of multipliers with relative error criteria (Q519776) (← links)
• Inexact proximal Newton methods for self-concordant functions (Q522088) (← links)
• The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth (Q523179) (← links)
• Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← links)
• A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
• Time-invariant Radon transform by generalized Fourier slice theorem (Q524724) (← links)
• An extragradient-based alternating direction method for convex minimization (Q525598) (← links)
• An iteratively approximated gradient projection algorithm for sparse signal reconstruction (Q529940) (← links)
• Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization (Q530079) (← links)
• A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming (Q530249) (← links)
• Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing (Q540241) (← links)
• A non-adapted sparse approximation of PDEs with stochastic inputs (Q543721) (← links)
• Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression) (Q544714) (← links)
• Adaptive algorithms for sparse system identification (Q553728) (← links)
• A box constrained gradient projection algorithm for compressed sensing (Q553750) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• Dualization of signal recovery problems (Q618873) (← links)
• Restoration of images based on subspace optimization accelerating augmented Lagrangian approach (Q629553) (← links)
• Convex approximations to sparse PCA via Lagrangian duality (Q631218) (← links)
• Random algorithms for convex minimization problems (Q644912) (← links)
• Incremental proximal methods for large scale convex optimization (Q644913) (← links)
• A new generalized shrinkage conjugate gradient method for sparse recovery (Q667880) (← links)
• A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations (Q667882) (← links)
• Iterative method with inertial for variational inequalities in Hilbert spaces (Q667885) (← links)
• Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning (Q669277) (← links)
• Primal and dual predicted decrease approximation methods (Q681488) (← links)
• Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss (Q683720) (← links)
• Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings (Q683928) (← links)
• An inertial proximal-gradient penalization scheme for constrained convex optimization problems (Q684039) (← links)
• Deviation optimal learning using greedy \(Q\)-aggregation (Q693750) (← links)
• Tree-guided group lasso for multi-response regression with structured sparsity, with an application to eQTL mapping (Q714367) (← links)
• An augmented Lagrangian approach for sparse principal component analysis (Q715084) (← links)
• Sample size selection in optimization methods for machine learning (Q715253) (← links)
• A class of customized proximal point algorithms for linearly constrained convex optimization (Q725706) (← links)
• Lagrangian penalization scheme with parallel forward-backward splitting (Q725876) (← links)
• The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\) (Q730526) (← links)
• Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots (Q739462) (← links)
• Fast proximity-gradient algorithms for structured convex optimization problems (Q739473) (← links)
• Fast global convergence of gradient methods for high-dimensional statistical recovery (Q741793) (← links)
• Generalized row-action methods for tomographic imaging (Q742852) (← links)
• Direct conditional probability density estimation with sparse feature selection (Q747244) (← links)
• Improving classification performance through selective instance completion (Q747264) (← links)
• A minimization approach for constructing generalized barycentric coordinates and its computation (Q777032) (← links)
• Stochastic primal dual fixed point method for composite optimization (Q777039) (← links)
• Theoretical guarantees for graph sparse coding (Q778037) (← links)
• Enhanced joint sparsity via iterative support detection (Q778436) (← links)
• Unified value-based feedback, optimization and risk management in complex electric energy systems (Q779759) (← links)