Pages that link to "Item:Q2368079"
From MaRDI portal
The following pages link to Dual coordinate ascent methods for non-strictly convex minimization (Q2368079):
Displayed 8 items.
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients (Q1032124) (← links)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
- A parallel descent algorithm for convex programming (Q1908925) (← links)
- Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243) (← links)
- Dykstras algorithm with bregman projections: A convergence proof (Q2709445) (← links)
- THE LINEAR TIME FREQUENCY ANALYSIS TOOLBOX (Q3164776) (← links)