Yinyu Ye
Affiliations:- Stanford University, Institute for Computational and Mathematical Engineering, CA, USA (PhD 1988)
- University of Iowa, Iowa City, IA, USA (former)
According to our database1,
Yinyu Ye
authored at least 242 papers
between 1987 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on isni.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
CoRR, 2024
Decoupling Learning and Decision-Making: Breaking the O(√T) Barrier in Online Resource Allocation with First-Order Methods.
CoRR, 2024
Trust Region Methods for Nonconvex Stochastic Optimization beyond Lipschitz Smoothness.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
Fisher markets with linear constraints: Equilibrium properties and efficient distributed algorithms.
Games Econ. Behav., September, 2023
Math. Program., July, 2023
Data-driven aerodynamic shape design with distributionally robust optimization approaches.
CoRR, 2023
CoRR, 2023
CoRR, 2023
A gradient descent akin method for constrained optimization: algorithms and applications.
CoRR, 2023
CoRR, 2023
Proceedings of the International Conference on Machine Learning, 2023
2022
High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks.
Oper. Res., November, 2022
Oper. Res., 2022
2021
Optim. Methods Softw., 2021
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization.
Math. Program. Comput., 2021
Worst-case complexity of cyclic coordinate descent: O(n<sup>2)</sup> gap with randomized version.
Math. Program., 2021
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods.
Math. Program., 2021
Correction to: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs.
Math. Program., 2021
Boosting Method in Approximately Solving Linear Programming with Fast Online Algorithm.
CoRR, 2021
The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks.
Proceedings of the 38th International Conference on Machine Learning, 2021
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].
Theor. Comput. Sci., 2020
A Mathematical Programming Formulation for Optimal Load Shifting of Electricity Demand for the Smart Grid.
IEEE Trans. Big Data, 2020
Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs.
Math. Program., 2020
Math. Oper. Res., 2020
CoRR, 2020
CoRR, 2020
Proceedings of the Web and Internet Economics - 16th International Conference, 2020
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Conic Descent and its Application to Memory-efficient Optimization over Positive Semidefinite Matrices.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020
2019
Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming.
Math. Program., 2019
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary.
Math. Program., 2019
Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights.
Math. Program., 2019
J. Mach. Learn. Res., 2019
CoRR, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
2018
On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering.
Theor. Comput. Sci., 2018
A computation study on an integrated alternating direction method of multipliers for large scale optimization.
Optim. Lett., 2018
CoRR, 2018
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the 35th International Conference on Machine Learning, 2018
2017
Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions.
Math. Program., 2017
Proceedings of the 34th International Conference on Machine Learning, 2017
2016
ACM Trans. Sens. Networks, 2016
The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent.
Math. Program., 2016
Found. Trends Optim., 2016
Worst-case Complexity of Cyclic Coordinate Descent: $O(n^2)$ Gap with Randomized Version.
CoRR, 2016
2015
Math. Program., 2015
Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization.
Math. Program., 2015
The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes.
Math. Oper. Res., 2015
Strong NP-Hardness Result for Regularized $L_q$-Minimization Problems with Concave Penalty Functions.
CoRR, 2015
2014
Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems.
Oper. Res., 2014
The Value of Stochastic Modeling in Two-Stage Stochastic Programs with Cost Uncertainty.
Oper. Res., 2014
Analytical Results and Efficient Algorithm for Optimal Portfolio Deleveraging with Market Impact.
Oper. Res., 2014
Comput. Optim. Appl., 2014
2013
IEEE Trans. Smart Grid, 2013
Optim. Methods Softw., 2013
Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems.
Math. Program. Comput., 2013
Math. Program., 2013
Beyond convex relaxation: A polynomial-time non-convex optimization approach to network localization.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013
2012
Math. Program., 2012
2011
Math. Program., 2011
The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate.
Math. Oper. Res., 2011
Close the Gaps: A Learning-while-Doing Algorithm for a Class of Single-Product Revenue Management Problems
CoRR, 2011
An interior-point path-following algorithm for computing a Leontief economy equilibrium.
Comput. Optim. Appl., 2011
Comput. Graph. Forum, 2011
2010
IEEE Trans. Signal Process., 2010
ACM Trans. Algorithms, 2010
IEEE Signal Process. Mag., 2010
Lower Bound Theory of Nonzero Entries in Solutions of ℓ<sub>2</sub>-ℓ<sub>p</sub> Minimization.
SIAM J. Sci. Comput., 2010
SIAM J. Optim., 2010
Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems.
Oper. Res., 2010
The Complexity of Determining the Uniqueness of Tarski's Fixed Point under the Lexicographic Ordering.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Universal Rigidity: Towards Accurate and Efficient Localization of Wireless Networks.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010
Probabilistic analysis of SDR detectors for MIMO systems.
Proceedings of the Convex Optimization in Signal Processing and Communications., 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
SIAM J. Optim., 2009
Math. Oper. Res., 2009
EURASIP J. Adv. Signal Process., 2009
CoRR, 2009
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
ACM Trans. Math. Softw., 2008
The complexity of equilibria: Hardness results for economies via a correspondence with games.
Theor. Comput. Sci., 2008
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation.
SIAM J. Sci. Comput., 2008
Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization.
SIAM J. Optim., 2008
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
On Analyzing Semidefinite Programming Relaxations of Complex Quadratic Optimization Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Exchange market equilibria with Leontief's utility: Freedom of pricing leads to rationality.
Theor. Comput. Sci., 2007
On approximating complex quadratic optimization problems via semidefinite programming relaxations.
Math. Program., 2007
Math. Program., 2007
A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs
CoRR, 2007
Proceedings of the Internet and Network Economics, Third International Workshop, 2007
Proceedings of the Internet and Network Economics, Third International Workshop, 2007
2006
ACM Trans. Sens. Networks, 2006
Semidefinite Programming Approaches for Sensor Network Localization With Noisy Distance Measurements.
IEEE Trans Autom. Sci. Eng., 2006
SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization.
SIAM J. Optim., 2006
SIAM J. Comput., 2006
Math. Program., 2006
A semidefinite programming approach to tensegrity theory and realizability of graphs.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
2005
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem.
Math. Oper. Res., 2005
Math. Oper. Res., 2005
Electron. Colloquium Comput. Complex., 2005
Proceedings of the Internet and Network Economics, First International Workshop, 2005
Market equilibria for homothetic, quasi-concave utilities and economies of scale in production.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005
2004
Improved Combinatorial Approximation Algorithms for the <i>k</i>-Level Facility Location Problem.
SIAM J. Discret. Math., 2004
Discret. Appl. Math., 2004
Proceedings of the Third International Symposium on Information Processing in Sensor Networks, 2004
A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract).
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
Proceedings of the 43rd IEEE Conference on Decision and Control, 2004
2003
Approximating the 2-catalog segmentation problem using semidefinite programming relaxations.
Optim. Methods Softw., 2003
J. Glob. Optim., 2003
An approximation algorithm for scheduling two parallel machines with capacity constraints.
Discret. Appl. Math., 2003
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
Proceedings of the 42nd IEEE Conference on Decision and Control, 2003
2002
Optimization with few violated constraints for linear bounded error parameter estimation.
IEEE Trans. Autom. Control., 2002
Oper. Res. Lett., 2002
Math. Program., 2002
An improved rounding method and semidefinite programming relaxation for graph partition.
Math. Program., 2002
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002
2001
IEEE Trans. Signal Process., 2001
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems.
Math. Program., 2001
2000
IEEE Trans. Autom. Control., 2000
SIAM J. Optim., 2000
SIAM J. Optim., 2000
1999
IEEE Trans. Autom. Control., 1999
IEEE Trans. Autom. Control., 1999
Math. Program., 1999
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems.
Math. Program., 1999
Math. Program., 1999
Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming.
Math. Oper. Res., 1999
J. Glob. Optim., 1999
On quadratic convergence of the O(√nK)-iteration homogeneous and self‐duallinear programming algorithm.
Ann. Oper. Res., 1999
1998
Math. Program., 1998
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming.
Math. Program., 1998
A Computational Study of the Homogeneous Algorithm for Large-scale Convex Optimization.
Comput. Optim. Appl., 1998
Proceedings of the 1998 IEEE International Conference on Acoustics, 1998
Interior point algorithms - theory and analysis.
Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-17420-2, 1998
1997
SIAM J. Optim., 1997
Complexity analysis of the analytic center cutting plane method that uses multiple cuts.
Math. Program., 1997
1996
An Asymptotical O(√(n) L)-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods.
SIAM J. Optim., 1996
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems.
SIAM J. Optim., 1996
A primal-dual interior point method whose running time depends only on the constraint matrix.
Math. Program., 1996
An infeasible interior-point algorithm for solving primal and dual geometric programs.
Math. Program., 1996
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling.
Math. Program., 1996
A simplified homogeneous and self-dual linear programming algorithm and its implementation.
Ann. Oper. Res., 1996
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms.
Ann. Oper. Res., 1996
1995
Oper. Res. Lett., 1995
Math. Program., 1995
A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming.
Math. Oper. Res., 1995
1994
Interior-Point Polynomial Algorithms in Convex Programming (Y. Nesterov and A. Nemirovskii).
SIAM Rev., 1994
A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar's Potential Function.
SIAM J. Optim., 1994
Math. Oper. Res., 1994
Math. Oper. Res., 1994
Combining Binary Search and Newton's Method to Compute Real Roots for a Class of Real Functions.
J. Complex., 1994
An accelerated interior point method whose running time depends only on A (extended abstract).
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994
1993
Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm.
SIAM J. Matrix Anal. Appl., October, 1993
A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems.
SIAM J. Optim., 1993
Near boundary behavior of primal-dual potential reduction algorithms for linear programming.
Math. Program., 1993
A quadratically convergent O(qudra root(n)*L)-iteration algorithm for linear programming.
Math. Program., 1993
On quadratic and O(qudar root(n) * L) convergence of a predictor-corrector algorithm for LCP.
Math. Program., 1993
Math. Program., 1993
A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem.
Math. Oper. Res., 1993
Math. Oper. Res., 1993
1992
Math. Program., 1992
Math. Program., 1992
An interior point potential reduction algorithm for the linear complementarity problem.
Math. Program., 1992
1991
Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program.
Oper. Res. Lett., 1991
Math. Program., 1991
Math. Program., 1991
1990
Math. Program., 1990
Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming.
Math. Oper. Res., 1990
1989
Math. Program., 1989
1987
Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming.
Math. Program., 1987