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.

• FISTA (Q23390) (← links)
• Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis (Q97534) (← links)
• Penalized Estimation and Forecasting of Multiple Subject Intensive Longitudinal Data (Q107040) (← links)
• Flexible and Interpretable Models for Survival Data (Q144105) (← links)
• Sparse Principal Component Analysis via Variable Projection (Q150980) (← links)
• fasta (Q151000) (← links)
• An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
• Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
• Entropy function-based algorithms for solving a class of nonconvex minimization problems (Q259115) (← links)
• A note on the complexity of proximal iterative hard thresholding algorithm (Q259117) (← links)
• Easy implementation of advanced tomography algorithms using the ASTRA toolbox with spot operators (Q261875) (← links)
• Accelerated gradient methods for nonconvex nonlinear and stochastic programming (Q263185) (← links)
• A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
• A second-order method for strongly convex \(\ell _1\)-regularization problems (Q263191) (← links)
• A semi-definite programming approach for robust tracking (Q263222) (← links)
• SURE-type functionals as criteria for parametric PSF estimation (Q268705) (← links)
• An adaptive accelerated first-order method for convex optimization (Q276852) (← links)
• Reconstruction of the magnetic particle imaging system matrix using symmetries and compressed sensing (Q277664) (← links)
• Wavelet inpainting with the \(\ell_{0}\) sparse regularization (Q285527) (← links)
• An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions (Q285919) (← links)
• On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921) (← links)
• Stochastic forward-backward splitting for monotone inclusions (Q289110) (← links)
• A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem (Q292553) (← links)
• Image deblurring via total variation based structured sparse model selection (Q293085) (← links)
• An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem (Q293116) (← links)
• On some steplength approaches for proximal algorithms (Q298853) (← links)
• Inertial Douglas-Rachford splitting for monotone inclusion problems (Q299664) (← links)
• An inexact successive quadratic approximation method for L-1 regularized optimization (Q301652) (← links)
• A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
• Stability and experimental comparison of prototypical iterative schemes for total variation regularized problems (Q302250) (← links)
• Levenberg-Marquardt method in Banach spaces with general convex regularization terms (Q303637) (← links)
• OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
• A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
• Accelerated compressed sensing based CT image reconstruction (Q308748) (← links)
• Sparsity regularization of the diffusion coefficient identification problem: well-posedness and convergence rates (Q310729) (← links)
• Optimized first-order methods for smooth convex minimization (Q312663) (← links)
• A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667) (← links)
• Gradient sliding for composite optimization (Q312670) (← links)
• On the ergodic convergence rates of a first-order primal-dual algorithm (Q312675) (← links)
• A family of second-order methods for convex \(\ell _1\)-regularized optimization (Q312690) (← links)
• On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients (Q315517) (← links)
• New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
• Conjugate gradient acceleration of iteratively re-weighted least squares methods (Q316180) (← links)
• Fast convex optimization via inertial dynamics with Hessian driven damping (Q324582) (← links)
• A fast patch-dictionary method for whole image recovery (Q326397) (← links)
• Controller architectures: tradeoffs between performance and structure (Q328177) (← links)
• The non-convex sparse problem with nonnegative constraint for signal reconstruction (Q328467) (← links)
• Sparse topical analysis of dyadic data using matrix tri-factorization (Q331699) (← links)
• Inverse source problem for the hyperbolic equation with a time-dependent principal part (Q338467) (← links)
• Bounded perturbation resilience of the viscosity algorithm (Q343563) (← links)