Pages that link to "Item:Q5921566"
From MaRDI portal
The following pages link to On the convergence of sequential minimization algorithms (Q5921566):
Displaying 10 items.
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- Some properties of a uniformly linearly independent sequence of subspaces (Q1138348) (← links)
- Decomposition algorithm for convex differentiable minimization (Q1176837) (← links)
- Minimization methods with constraints (Q1234628) (← links)
- Descent methods for convex essentially smooth minimization (Q1321119) (← links)
- On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
- An efficient method for clustered multi-metric learning (Q2200672) (← links)
- Relaxation methods for problems with strictly convex separable costs and linear constraints (Q3777809) (← links)
- On the convergence of sequential minimization algorithms (Q5917363) (← links)
- Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent (Q6491346) (← links)
