On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
From MaRDI portal
Publication:6506828
arXiv2210.09665MaRDI QIDQ6506828
Author name not available (Why is that?)
Abstract: We propose a random coordinate descent algorithm for optimizing a non-convex objective function subject to one linear constraint and simple bounds on the variables. Although it is common use to update only two random coordinates simultaneously in each iteration of a coordinate descent algorithm, our algorithm allows updating arbitrary number of coordinates. We provide a proof of convergence of the algorithm. The convergence rate of the algorithm improves when we update more coordinates per iteration. Numerical experiments on large scale instances of different optimization problems show the benefit of updating many coordinates simultaneously.
Has companion code repository: https://github.com/LMSinjorgo/qRCCA-algorithm
No records found.
This page was built for publication: On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6506828)
