Pages that link to "Item:Q2162523"

The following pages link to Block coordinate descent for smooth nonconvex constrained minimization (Q2162523):

Displaying 9 items.

• On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
• The blockwise coordinate descent method for integer programs (Q2189480) (← links)
• Markov chain block coordinate descent (Q2301127) (← links)
• On the convergence of inexact block coordinate descent methods for constrained optimization (Q2356093) (← links)
• Accelerated block-coordinate relaxation for regularized optimization (Q2902875) (← links)
• Acceleration of block coordinate descent method achieves the $\bm{O(\frac{1}{k^2})}$ rate of convergence for a convex function with block coordinate strong convexity (Q5063626) (← links)
• Convergence of a block coordinate descent method for nondifferentiable minimization (Q5945065) (← links)
• Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices (Q6101125) (← links)
• Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent (Q6491346) (← links)