Ernest K. Ryu

Ernest K. Ryu

Auto-generated profile, based on publicly available information

Ernest K. Ryu

Department of Mathematics University of California Los Angeles

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 July 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
SASulaiman A. Alghunaim
Sulaiman A. Alghunaim
ERErnest K. Ryu
Ernest K. Ryu
KYKun Yuan
Kun Yuan
ASAli H. Sayed
Ali H. Sayed
This work studies a class of non-smooth decentralized multi-agent optimization problems where the agents aim at minimizing a sum of local strongly-convex smooth components plus a common non-smooth term. We propose a general primal-dual algorithmic framework that captures many existing state-of-the-art algorithms including the adapt-then-combine gradient-tracking methods for smooth costs. We then prove linear convergence of the proposed method (to the exact minimizer) in the presence of the non-smooth term. Moreover, for the more general class of problems with agent specific non-smooth terms, we show that linear convergence cannot be achieved (in the worst case) for the class of algorithms that uses the gradients and the proximal mappings of the smooth and non-smooth parts, respectively. We further provide a numerical counterexample that shows some state-of-the-art algorithms fail to converge linearly for strongly-convex objectives and different local non-smooth terms.

1 January 2020 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
ERErnest K. Ryu
Ernest K. Ryu
ATAdrien B. Taylor
Adrien B. Taylor
CBCarolina Bergeling
Carolina Bergeling
PGPontus Giselsson
Pontus Giselsson
We propose a methodology for studying the performance of common splitting methods through semidefinite programming. We prove tightness of the methodology and demonstrate its value by presenting two applications of it. First, we use the methodology as a tool for computer-assisted proofs to prove tight analytical contraction factors for Douglas--Rachford splitting that are likely too complicated for a human to find bare-handed. Second, we use the methodology as an algorithmic tool to computationally select the optimal splitting method parameters by solving a series of semidefinite programs.

11 August 2017 in Journal of Scientific Computing
Verified
Journal Article
Closed access
PDF file
WLWuchen Li
Wuchen Li
ERErnest K. Ryu
Ernest K. Ryu
SOStanley Osher
Stanley Osher
WYWotao Yin
Wotao Yin
WGWilfrid Gangbo
Wilfrid Gangbo



2 June 2021 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
ERErnest K. Ryu
Ernest K. Ryu
RHRobert Hannah
Robert Hannah
WYWotao Yin
Wotao Yin