☰ E-Tree

Yinyu Ye

Affiliations:			Stanford University, Palo Alto, CA
			University of Iowa, Iowa City, IA

Google:

Tree Publications Similar researchers PubMed Report error

Parents

George Bernard Dantzig	grad student	1988	Stanford
(Interior Algorithms for Linear, Quadratic, and Linearly Constrained Convex Programming)
Edison Tack-Shuen Tse	grad student	1988	Stanford
(Interior Algorithms for Linear, Quadratic, and Linearly Constrained Convex Programming)

Children

Jiawei Zhang	grad student	2004	Stanford
Pratik Biswas	grad student	2007	Stanford
Anthony M. So	grad student	2007	Stanford
Kan-Lin Hsiung	grad student	2008	Stanford
John G. Carlsson	grad student	2009	Stanford
Erick H. Delage	grad student	2009	Stanford
Dongdong Ge	grad student	2009	Stanford

Collaborators

BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.
Sun R, Luo Z, Ye Y. (2020) On the Efficiency of Random Permutation for ADMM and Coordinate Descent Mathematics of Operations Research. 45: 233-271
Dang C, Ye Y. (2020) Erratum/Correction to “On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering” [Theor. Comput. Sci. 732 (2018) 26–45] Theoretical Computer Science. 817: 80
Burer S, Ye Y. (2020) Exact Semidefinite Formulations for a Class of (Random and Non-Random) Nonconvex Quadratic Programs Mathematical Programming. 181: 1-17
Liu H, Wang X, Yao T, et al. (2019) Sample Average Approximation with Sparsity-Inducing Penalty for High-Dimensional Stochastic Programming. Mathematical Programming. 78: 69-108
Haeser G, Hinder O, Ye Y. (2019) On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods Mathematical Programming. 1-32
Haeser G, Liu H, Ye Y. (2019) Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary Mathematical Programming. 178: 263-299
Chen C, Li M, Liu X, et al. (2019) Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights Mathematical Programming. 173: 37-77
Dang C, Ye Y. (2018) On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering Theoretical Computer Science. 732: 26-45
Zarepisheh M, Xing L, Ye Y. (2018) A computation study on an integrated alternating direction method of multipliers for large scale optimization Optimization Letters. 12: 3-15
Liu H, Yao T, Li R, et al. (2017) Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions. Mathematical Programming. 166: 207-240

See more...