Acceleration for proximal stochastic dual coordinate ascent algorithm in solving regularised loss minimisation with ℓ 2 norm
Sign Up to like & getrecommendations! Published in 2018 at "Electronics Letters"
DOI: 10.1049/el.2017.4544
Abstract: An accelerated version of the proximal stochastic dual coordinate ascent (SDCA) algorithm in solving regularised loss minimisation with l 2 norm is presented, wherein a momentum is introduced and the strong theoretical guarantees of SDCA… read more here.
Keywords: solving regularised; proximal stochastic; coordinate ascent; dual coordinate ... See more keywords
Low-Complexity WSRMax Precoder Design Using the Dual Coordinate Ascent Method
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Wireless Communications Letters"
DOI: 10.1109/lwc.2022.3227058
Abstract: We propose a low-complexity precoder design for weighted sum rate maximization (WSRMax) in multiuser multiple-input-multiple-output systems with per-antenna power constraints (PAPCs). The proposed design is based on the alternating optimization framework and a fast dual… read more here.
Keywords: ascent method; coordinate ascent; dual coordinate; method ... See more keywords
PPD: A Scalable and Efficient Parallel Primal-Dual Coordinate Descent Algorithm
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Knowledge and Data Engineering"
DOI: 10.1109/tkde.2020.3000905
Abstract: Dual Coordinate Descent (DCD) is one of the most popular optimization methods. The parallelization of DCD is difficult, as DCD is sequential in nature. As such, simultaneously running multiple DCD threads on batches of data… read more here.
Keywords: ppd; coordinate descent; parallel primal; primal dual ... See more keywords