Pages that link to "Item:Q2419552"
From MaRDI portal
The following pages link to An almost cyclic 2-coordinate descent method for singly linearly constrained problems (Q2419552):
Displaying 7 items.
- A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- A Derivative-Free Method for Structured Optimization Problems (Q4987276) (← 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)
- PolyCD: optimization via cycling through the vertices of a polytope (Q6633143) (← links)
- On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems (Q6635808) (← links)
