Pages that link to "Item:Q463005"
From MaRDI portal
The following pages link to The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005):
Displaying 12 items.
- A method of bi-coordinate variations with tolerances and its convergence (Q268944) (← links)
- Selective bi-coordinate variations for resource allocation type problems (Q301690) (← links)
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
- Distributed resource allocation on dynamic networks in quadratic time (Q503828) (← links)
- Primal and dual predicted decrease approximation methods (Q681488) (← links)
- A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
- Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← links)
- Selective bi-coordinate method for limit non-smooth resource allocation type problems (Q2416621) (← links)
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems (Q2419552) (← links)
- A Coordinate Wise Variational Method with Tolerance Functions (Q4957493) (← links)
- Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
- Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent (Q6491346) (← links)
