3 citations · 8 across the 5 of their papers we have counts for
5 papers
Coordinate-Update Algorithms can Efficiently Detect Infeasible Optimization Problems
Jinhee Paeng, Jisun Park, Ernest K. Ryu
Coordinate update/descent algorithms are widely used in large-scale optimization due to their low per-iteration cost and scalability, but their behavior on infeasible or misspecifi…
Continuous-time Analysis of Anchor Acceleration
Jaewook J. Suh, Jisun Park, Ernest K. Ryu
Recently, the anchor acceleration, an acceleration mechanism distinct from Nesterov's, has been discovered for minimax optimization and fixed-point problems, but its mechanism is n…
Accelerated Infeasibility Detection of Constrained Optimization and Fixed-Point Iterations
Jisun Park, Ernest K. Ryu
As first-order optimization methods become the method of choice for solving large-scale optimization problems, optimization solvers based on first-order algorithms are being built.…
Exact Optimal Accelerated Complexity for Fixed-Point Iterations
Jisun Park, Ernest K. Ryu
Despite the broad use of fixed-point iterations throughout applied mathematics, the optimal convergence rate of general fixed-point problems with nonexpansive nonlinear operators h…
Factor- Acceleration of Accelerated Gradient Methods
Chanwoo Park, Jisun Park, Ernest K. Ryu
The optimized gradient method (OGM) provides a factor- speedup upon Nesterov's celebrated accelerated gradient method in the convex (but non-strongly convex) setup. Howev…