9 citations · 24 across the 12 of their papers we have counts for
6 papers · 1 filter
Randomized methods for computing optimal transport without regularization and their convergence analysis
Yue Xie, Zhongjian Wang, Zhiwen Zhang
The optimal transport (OT) problem can be reduced to a linear programming (LP) problem through discretization. In this paper, we introduced the random block coordinate descent (RBC…
Complexity of a Projected Newton-CG Method for Optimization with Bounds
Yue Xie, Stephen J. Wright
This paper describes a method for solving smooth nonconvex minimization problems subject to bound constraints with good worst-case complexity guarantees and practical performance.…
Complexity of Proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
Yue Xie, Stephen J. Wright
We analyze worst-case complexity of a Proximal augmented Lagrangian (Proximal AL) framework for nonconvex optimization with nonlinear equality constraints. When an approximate firs…
SI-ADMM: A Stochastic Inexact ADMM Framework for Stochastic Convex Programs
Yue Xie, Uday V. Shanbhag
We consider the structured stochastic convex program requiring the minimization of subject to the constraint . Mo…
Tractable ADMM Schemes for Computing KKT Points and Local Minimizers for -Minimization Problems
Yue Xie, Uday V. Shanbhag
We consider an -minimization problem where is minimized over a polyhedral set and the -norm regularizer implicitly emphasizes sparsity of the solu…
On robust solutions to uncertain linear complementarity problems and their variants
Yue Xie, Uday V. Shanbhag
A popular approach for addressing uncertainty in variational inequality problems is by solving the expected residual minimization (ERM) problem. This avenue necessitates distributi…