11 citations · 19 across the 2 of their papers we have counts for
6 papers · 1 filter
A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization
Bo Jiang, Tianyi Lin, Shuzhong Zhang
In this paper, we propose a unified two-phase scheme to accelerate any high-order regularized tensor approximation approach on the smooth part of a composite convex optimization mo…
Improved Sample Complexity for Stochastic Compositional Variance Reduced Gradient
Tianyi Lin, Chenyou Fan, Mengdi Wang +1
Convex composition optimization is an emerging topic that covers a wide range of applications arising from stochastic optimal control, reinforcement learning and multi-stage stocha…
An ADMM-Based Interior-Point Method for Large-Scale Linear Programming
Tianyi Lin, Shiqian Ma, Yinyu Ye +1
We propose a new framework to implement interior point method (IPM) to solve very large linear programs (LP). Traditional IPMs typically use Newton's method to approximately solve…
Improved Oracle Complexity of Variance Reduced Methods for Nonsmooth Convex Stochastic Composition Optimization
Tianyi Lin, Chenyou Fan, Mengdi Wang
We consider the nonsmooth convex composition optimization problem where the objective is a composition of two finite-sum functions and analyze stochastic compositional variance red…
A Unified Scheme to Accelerate Adaptive Cubic Regularization and Gradient Methods for Convex Optimization
Bo Jiang, Tianyi Lin, Shuzhong Zhang
In this paper we propose a unified two-phase scheme for convex optimization to accelerate: (1) the adaptive cubic regularization methods with exact/inexact Hessian matrices, and (2…
Iteration Complexity Analysis of Multi-Block ADMM for a Family of Convex Minimization without Strong Convexity
Tianyi Lin, Shiqian Ma, Shuzhong Zhang
The alternating direction method of multipliers (ADMM) is widely used in solving structured convex optimization problems due to its superior practical performance. On the theoretic…