Linear Convergence of Stochastic Block-Coordinate Fixed Point Algorithms. Combettes, P. L. & Pesquet, J. In *2018 26th European Signal Processing Conference (EUSIPCO)*, pages 742-746, Sep., 2018.

Paper doi abstract bibtex

Paper doi abstract bibtex

Recent random block-coordinate fixed point algorithms are particularly well suited to large-scale optimization in signal and image processing. These algorithms feature random sweeping rules to select arbitrarily the blocks of variables that are activated over the course of the iterations and they allow for stochastic errors in the evaluation of the operators. The present paper provides new linear convergence results. These convergence rates are compared to those of standard deterministic algorithms both theoretically and experimentally in an image recovery problem.

@InProceedings{8552941, author = {P. L. Combettes and J. Pesquet}, booktitle = {2018 26th European Signal Processing Conference (EUSIPCO)}, title = {Linear Convergence of Stochastic Block-Coordinate Fixed Point Algorithms}, year = {2018}, pages = {742-746}, abstract = {Recent random block-coordinate fixed point algorithms are particularly well suited to large-scale optimization in signal and image processing. These algorithms feature random sweeping rules to select arbitrarily the blocks of variables that are activated over the course of the iterations and they allow for stochastic errors in the evaluation of the operators. The present paper provides new linear convergence results. These convergence rates are compared to those of standard deterministic algorithms both theoretically and experimentally in an image recovery problem.}, keywords = {convergence of numerical methods;deterministic algorithms;image denoising;iterative methods;optimisation;stochastic processes;standard deterministic algorithms;stochastic block-coordinate fixed point algorithms;image processing;random sweeping rules;linear convergence;random block-coordinate fixed point algorithms;iterations;signal processing;image recovery problem;Convergence;Signal processing algorithms;Random variables;Signal processing;Standards;Europe;Clustering algorithms;Block-coordinate algorithm;fixed-point algorithm;linear convergence;stochastic algorithm}, doi = {10.23919/EUSIPCO.2018.8552941}, issn = {2076-1465}, month = {Sep.}, url = {https://www.eurasip.org/proceedings/eusipco/eusipco2018/papers/1570436777.pdf}, }

Downloads: 0

{"_id":"DAf7uLMv4pjGg9tBS","bibbaseid":"combettes-pesquet-linearconvergenceofstochasticblockcoordinatefixedpointalgorithms-2018","authorIDs":[],"author_short":["Combettes, P. L.","Pesquet, J."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["P.","L."],"propositions":[],"lastnames":["Combettes"],"suffixes":[]},{"firstnames":["J."],"propositions":[],"lastnames":["Pesquet"],"suffixes":[]}],"booktitle":"2018 26th European Signal Processing Conference (EUSIPCO)","title":"Linear Convergence of Stochastic Block-Coordinate Fixed Point Algorithms","year":"2018","pages":"742-746","abstract":"Recent random block-coordinate fixed point algorithms are particularly well suited to large-scale optimization in signal and image processing. These algorithms feature random sweeping rules to select arbitrarily the blocks of variables that are activated over the course of the iterations and they allow for stochastic errors in the evaluation of the operators. The present paper provides new linear convergence results. These convergence rates are compared to those of standard deterministic algorithms both theoretically and experimentally in an image recovery problem.","keywords":"convergence of numerical methods;deterministic algorithms;image denoising;iterative methods;optimisation;stochastic processes;standard deterministic algorithms;stochastic block-coordinate fixed point algorithms;image processing;random sweeping rules;linear convergence;random block-coordinate fixed point algorithms;iterations;signal processing;image recovery problem;Convergence;Signal processing algorithms;Random variables;Signal processing;Standards;Europe;Clustering algorithms;Block-coordinate algorithm;fixed-point algorithm;linear convergence;stochastic algorithm","doi":"10.23919/EUSIPCO.2018.8552941","issn":"2076-1465","month":"Sep.","url":"https://www.eurasip.org/proceedings/eusipco/eusipco2018/papers/1570436777.pdf","bibtex":"@InProceedings{8552941,\n author = {P. L. Combettes and J. Pesquet},\n booktitle = {2018 26th European Signal Processing Conference (EUSIPCO)},\n title = {Linear Convergence of Stochastic Block-Coordinate Fixed Point Algorithms},\n year = {2018},\n pages = {742-746},\n abstract = {Recent random block-coordinate fixed point algorithms are particularly well suited to large-scale optimization in signal and image processing. These algorithms feature random sweeping rules to select arbitrarily the blocks of variables that are activated over the course of the iterations and they allow for stochastic errors in the evaluation of the operators. The present paper provides new linear convergence results. These convergence rates are compared to those of standard deterministic algorithms both theoretically and experimentally in an image recovery problem.},\n keywords = {convergence of numerical methods;deterministic algorithms;image denoising;iterative methods;optimisation;stochastic processes;standard deterministic algorithms;stochastic block-coordinate fixed point algorithms;image processing;random sweeping rules;linear convergence;random block-coordinate fixed point algorithms;iterations;signal processing;image recovery problem;Convergence;Signal processing algorithms;Random variables;Signal processing;Standards;Europe;Clustering algorithms;Block-coordinate algorithm;fixed-point algorithm;linear convergence;stochastic algorithm},\n doi = {10.23919/EUSIPCO.2018.8552941},\n issn = {2076-1465},\n month = {Sep.},\n url = {https://www.eurasip.org/proceedings/eusipco/eusipco2018/papers/1570436777.pdf},\n}\n\n","author_short":["Combettes, P. L.","Pesquet, J."],"key":"8552941","id":"8552941","bibbaseid":"combettes-pesquet-linearconvergenceofstochasticblockcoordinatefixedpointalgorithms-2018","role":"author","urls":{"Paper":"https://www.eurasip.org/proceedings/eusipco/eusipco2018/papers/1570436777.pdf"},"keyword":["convergence of numerical methods;deterministic algorithms;image denoising;iterative methods;optimisation;stochastic processes;standard deterministic algorithms;stochastic block-coordinate fixed point algorithms;image processing;random sweeping rules;linear convergence;random block-coordinate fixed point algorithms;iterations;signal processing;image recovery problem;Convergence;Signal processing algorithms;Random variables;Signal processing;Standards;Europe;Clustering algorithms;Block-coordinate algorithm;fixed-point algorithm;linear convergence;stochastic algorithm"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/Roznn/EUSIPCO/main/eusipco2018url.bib","creationDate":"2021-02-13T15:38:39.971Z","downloads":0,"keywords":["convergence of numerical methods;deterministic algorithms;image denoising;iterative methods;optimisation;stochastic processes;standard deterministic algorithms;stochastic block-coordinate fixed point algorithms;image processing;random sweeping rules;linear convergence;random block-coordinate fixed point algorithms;iterations;signal processing;image recovery problem;convergence;signal processing algorithms;random variables;signal processing;standards;europe;clustering algorithms;block-coordinate algorithm;fixed-point algorithm;linear convergence;stochastic algorithm"],"search_terms":["linear","convergence","stochastic","block","coordinate","fixed","point","algorithms","combettes","pesquet"],"title":"Linear Convergence of Stochastic Block-Coordinate Fixed Point Algorithms","year":2018,"dataSources":["yiZioZximP7hphDpY","iuBeKSmaES2fHcEE9"]}