4 papers
One-Sided Matrix Completion from Ultra-Sparse Samples
Hongyang R. Zhang, Zhenshuo Zhang, Huy L. Nguyen +1
Matrix completion is a classical problem that has received recurring interest across a wide range of fields. In this paper, we revisit this problem in an ultra-sparse sampling regi…
High-order Accumulative Regularization for Gradient Minimization in Convex Programming
Yao Ji, Guanghui Lan
This paper develops a unified high-order accumulative regularization (AR) framework for convex and uniformly convex gradient norm minimization. Existing high-order methods often ex…
Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization
Qi Deng, Guanghui Lan, Zhenwei Lin
This paper presents new first-order methods for achieving optimal oracle complexities in convex optimization with convex functional constraints. Oracle complexities are measured by…
Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliers
Guanghui Lan, Tianjiao Li
Line search procedures are often employed in primal-dual methods for bilinear saddle point problems, especially when the norm of the linear operator is large or difficult to comput…