Pages that link to "Item:Q2311100"
From MaRDI portal
The following pages link to ``Active-set complexity'' of proximal gradient: how long does it take to find the sparsity pattern? (Q2311100):
Displaying 14 items.
- Nonsmoothness in machine learning: specific structure, proximal identification, and applications (Q829492) (← links)
- Avoiding bad steps in Frank-Wolfe variants (Q2111475) (← links)
- An augmented Lagrangian method exploiting an active-set strategy and second-order information (Q2139257) (← links)
- Screening for a reweighted penalized conditional gradient method (Q2165597) (← links)
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals (Q2670979) (← links)
- Distributed Learning with Sparse Communications by Identification (Q4959464) (← links)
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer (Q5072590) (← links)
- Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
- Thresholding gradient methods in Hilbert spaces: support identification and linear convergence (Q5109200) (← links)
- Active Set Complexity of the Away-Step Frank--Wolfe Algorithm (Q5124005) (← links)
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants (Q5233104) (← links)
- Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)
- Cardinality-constrained structured data-fitting problems (Q6584338) (← links)
- A proximal-gradient method for problems with overlapping group-sparse regularization: support identification complexity (Q6641006) (← links)
