Answers are grounded in this paper and cite their sources.
A block coordinate descent method, is an iterative procedure that solves block-structured optimization problems, where each block of coordinates is subject to its own constraints, by sequentially solving the same problem with respect to each block, while the other coordinates are held fixed. For such problems, we develop new methods that act by solving less constrained and of smaller size subproblems. We propose two methods: The block coordinate descent method of centres and the block coordinate descent proximal method of centres. They have two advantages: From one side, the intermediate problems to solve are unconstrained or at least less constrained, and from an other side, are of smaller size than the original problem. Under regularity properties involving the objective function, we establish optimality conditions on the entire decision variable, based on those established for its block coordinates. These methods generate sequences whose every cluster point satisfies these optimality conditions. Finally, we conclude by numerical examples for comparing our algorithms with existing methods and testing their efficiency.
No takes yet. Share an insight, caveat, or question.
Kharfati et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: