Sign Up to like & get
recommendations!
0
Published in 2019 at "Journal of Optimization Theory and Applications"
DOI: 10.1007/s10957-019-01542-7
Abstract: AbstractTwo characteristics that make convex decomposition algorithms attractive are simplicity of operations and generation of parallelizable structures. In principle, these schemes require that all coordinates update at the same time, i.e., they are synchronous by…
read more here.
Keywords:
iteration;
convex optimization;
asynchronous forward;
optimization ... See more keywords