activity
20182021
most citedBacktracking linesearch for conditional gradient sliding

1 citations · 2 across the 4 of their papers we have counts for

collaborators

7 papers

math.OC20211 cited

Mirror-prox sliding methods for solving a class of monotone variational inequalities

Guanghui Lan, Yuyuan Ouyang

In this paper we propose new algorithms for solving a class of structured monotone variational inequality (VI) problems over compact feasible sets. By identifying the gradient comp…

math.OC2021

Universal Conditional Gradient Sliding for Convex Optimization

Yuyuan Ouyang, Trevor Squires

In this paper, we present a first-order projection-free method, namely, the universal conditional gradient sliding (UCGS) method, for solving -approximate solutions to…

math.OC2021

Graph topology invariant gradient and sampling complexity for decentralized and stochastic optimization

Guanghui Lan, Yuyuan Ouyang, Yi Zhou

One fundamental problem in decentralized multi-agent optimization is the trade-off between gradient/sampling complexity and communication complexity. We propose new algorithms whos…

math.OC20201 cited

Backtracking linesearch for conditional gradient sliding

Hamid Nazari, Yuyuan Ouyang

We present a modification of the conditional gradient sliding (CGS) method that was originally developed in \cite{lan2016conditional}. While the CGS method is a theoretical breakth…

math.ST2020

An Asymptotic Result of Conditional Logistic Regression Estimator

Zhulin He, Yuyuan Ouyang

In cluster-specific studies, ordinary logistic regression and conditional logistic regression for binary outcomes provide maximum likelihood estimator (MLE) and conditional maximum…

math.OC2019

Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression

Yuyuan Ouyang, Trevor Squires

We present in this paper some worst-case datasets of deterministic first-order methods for solving large-scale binary logistic regression problems. Under the assumption that the nu…