Pages that link to "Item:Q3083309"
From MaRDI portal
The following pages link to Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints (Q3083309):
Displaying 28 items.
- Convex optimization on Banach spaces (Q285434) (← links)
- Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee (Q331671) (← links)
- Convergence and rate of convergence of some greedy algorithms in convex optimization (Q338510) (← links)
- Adaptive and optimal online linear regression on \(\ell^1\)-balls (Q391734) (← links)
- Greedy expansions in convex optimization (Q483395) (← links)
- Decomposable norm minimization with proximal-gradient homotopy algorithm (Q513723) (← links)
- Deviation optimal learning using greedy \(Q\)-aggregation (Q693750) (← links)
- Nonlinear tensor product approximation of functions (Q890230) (← links)
- Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy (Q2091111) (← links)
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications (Q2104053) (← links)
- Biorthogonal greedy algorithms in convex optimization (Q2155817) (← links)
- Gradient projection Newton pursuit for sparsity constrained optimization (Q2168680) (← links)
- Generalized greedy alternatives (Q2175011) (← links)
- Greedy approximation in convex optimization (Q2343051) (← links)
- Greedy strategies for convex optimization (Q2363679) (← links)
- A greedy Newton-type method for multiple sparse constraint problem (Q2696970) (← links)
- (Q4437878) (← links)
- (Q4558490) (← links)
- Sparse Approximation by Greedy Algorithms (Q4609500) (← links)
- Generalized Conditional Gradient for Sparse Estimation (Q4637076) (← links)
- Non-Negative Sparse Regression and Column Subset Selection with L1 Error (Q4993270) (← links)
- (Q4998877) (← links)
- (Q4999097) (← links)
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization (Q5962715) (← links)
- Structured sparsity through convex optimization (Q5965303) (← links)
- Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping (Q6072435) (← links)
- Asymptotic linear convergence of fully-corrective generalized conditional gradient methods (Q6126647) (← links)
- Statistical computational learning (Q6602226) (← links)
