Pages that link to "Item:Q2848186"

The following pages link to A proximal-gradient homotopy method for the sparse least-squares problem (Q2848186):

Displaying 32 items.

• Optimal computational and statistical rates of convergence for sparse nonconvex learning problems (Q482875) (← links)
• Decomposable norm minimization with proximal-gradient homotopy algorithm (Q513723) (← links)
• High-dimensional model recovery from random sketched data by exploring intrinsic sparsity (Q782446) (← links)
• Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations (Q829377) (← links)
• A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem (Q890462) (← links)
• A unified approach to error bounds for structured convex optimization problems (Q1675267) (← links)
• Complexity and applications of the homotopy principle for uniformly constrained sparse minimization (Q2019907) (← links)
• Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems (Q2022292) (← links)
• Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
• Weighted thresholding homotopy method for sparsity constrained optimization (Q2082209) (← links)
• Nonregular and minimax estimation of individualized thresholds in high dimension with binary responses (Q2091840) (← links)
• Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis (Q2116020) (← links)
• A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint (Q2149159) (← links)
• A data-driven line search rule for support recovery in high-dimensional data analysis (Q2157522) (← links)
• New analysis of linear convergence of gradient-type methods via unifying error bound conditions (Q2297652) (← links)
• An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization (Q2352420) (← links)
• A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244) (← links)
• A sparse proximal implementation of the LP dual active set algorithm (Q2465650) (← links)
• On convergence rates of linearized proximal algorithms for convex composite optimization with applications (Q2810547) (← links)
• A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression (Q2830631) (← links)
• (Q4558147) (← links)
• Fast and Reliable Parameter Estimation from Nonlinear Observations (Q4588858) (← links)
• (Q4614089) (← links)
• The homotopy method revisited: Computing solution paths of $\ell _1$-regularized problems (Q4640325) (← links)
• A fast homotopy algorithm for gridless sparse recovery (Q5148425) (← links)
• Generalized Conjugate Gradient Methods for <i>ℓ</i>₁ Regularized Convex Quadratic Programming with Finite Convergence (Q5219295) (← links)
• An homotopy method for l _p regression provably beyond self-concordance and in input-sparsity time (Q5230368) (← links)
• Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization (Q5355205) (← links)
• Proximal variable metric method with spectral diagonal update for large scale sparse optimization (Q6099831) (← links)
• Accelerate the warm-up stage in the Lasso computation via a homotopic approach (Q6115541) (← links)
• Joint sparse optimization: lower-order regularization method and application in cell fate conversion (Q6581202) (← links)
• Homotopic policy mirror descent: policy convergence, algorithmic regularization, and improved sample complexity (Q6608040) (← links)