What question did this study set out to answer?

The aim is to enhance the efficiency of minimizing convex functions using parallel block coordinate descent methods with identification strategies.

Parallel block coordinate descent methods with identification strategies

View Full Paper

Ask AI

Bookmark

Authors

This work demonstrates improved efficiency in minimizing block-separable convex functions, suggesting better computational strategies.

The aim is to enhance the efficiency of minimizing convex functions using parallel block coordinate descent methods with identification strategies.
Developed a parallel variant of an existing block coordinate descent algorithm.
Focused computational efforts on selecting nonzero coordinates via nonuniform probability distributions.
Conducted numerical experiments on both synthetic and real datasets.
Achieved improved efficiency in minimizing the functions compared to traditional methods.
Presented convergence results that support the effectiveness of the proposed method.
Demonstrated effectiveness on regularized regression problems.

Lopes et al. (2026) studied this question.

View Full Paper

Ask AI

Bookmark