# Yinyu Ye

According to our database1, Yinyu Ye authored at least 191 papers between 1987 and 2019.

Collaborative distances:

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2019
Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming.
Math. Program., 2019

Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights.
Math. Program., 2019

Approximation Hardness for A Class of Sparse Optimization Problems.
J. Mach. Learn. Res., 2019

Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds.
CoRR, 2019

Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity.
CoRR, 2019

On a Randomized Multi-Block ADMM for Solving Selected Machine Learning Problems.
CoRR, 2019

Toward Solving 2-TBSG Efficiently.
CoRR, 2019

2018
Assessing the System Value of Optimal Load Shifting.
IEEE Trans. Smart Grid, 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.
Optimization Letters, 2018

A polynomial time log barrier method for problems with nonconvex constraints.
CoRR, 2018

Learning in Games with Lossy Feedback.
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

Distributed Asynchronous Optimization with Unbounded Delays: How Slow Can You Go?
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

Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes.
CoRR, 2017

Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary.
CoRR, 2017

Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
Leontief Economy Equilibrium.
Encyclopedia of Algorithms, 2016

Hidden-City Ticketing: The Cause and Impact.
Transportation Science, 2016

On a New SDP-SOCP Method for Acoustic Source Localization Problem.
TOSN, 2016

The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent.
Math. Program., 2016

Low-Rank Semidefinite Programming: Theory and Applications.
Foundations and Trends in Optimization, 2016

Worst-case Complexity of Cyclic Coordinate Descent: $O(n^2)$ Gap with Randomized Version.
CoRR, 2016

Likelihood robust optimization for data-driven problems.
Comput. Manag. Science, 2016

2015
A homogeneous interior-point algorithm for nonsymmetric convex conic optimization.
Math. Program., 2015

Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization.
Math. Program., 2015

Micro-Doppler Ambiguity Resolution Based on Short-Time Compressed Sensing.
J. Electrical and Computer Engineering, 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.
Operations Research, 2014

The Value of Stochastic Modeling in Two-Stage Stochastic Programs with Cost Uncertainty.
Operations Research, 2014

Analytical Results and Efficient Algorithm for Optimal Portfolio Deleveraging with Market Impact.
Operations Research, 2014

A Dynamic Near-Optimal Algorithm for Online Linear Programming.
Operations Research, 2014

Space tensor conic programming.
Comp. Opt. and Appl., 2014

A Levenberg-Marquardt method with approximate projections.
Comp. Opt. and Appl., 2014

2013
A Dynamic Algorithm for Facilitated Charging of Plug-In Electric Vehicles.
IEEE Trans. Smart Grid, 2013

Newsvendor optimization with limited distribution information.
Optimization Methods and Software, 2013

Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems.
Math. Program. Comput., 2013

On stress matrices of (d + 1)-lateration frameworks in general position.
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
A FPTAS for computing a symmetric Leontief competitive economy equilibrium.
Math. Program., 2012

The cubic spherical optimization problems.
Math. Comput., 2012

Price of Correlations in Stochastic Optimization.
Operations Research, 2012

The simplex method is strongly polynomial for deterministic Markov decision processes
CoRR, 2012

2011
Statistical ranking and combinatorial Hodge theory.
Math. Program., 2011

A note on the complexity of Lp minimization.
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

Geometric rounding: a dependent randomized rounding scheme.
J. Comb. Optim., 2011

A Unified Framework for Dynamic Prediction Market Design.
Operations Research, 2011

Complexity of Unconstrained L_2-L_p Minimization
CoRR, 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.
Comp. Opt. and Appl., 2011

An Optimization Approach to Improving Collections of Shape Maps.
Comput. Graph. Forum, 2011

2010
Dynamic spectrum management with the competitive market model.
IEEE Trans. Signal Processing, 2010

Finding equitable convex partitions of points in a polygon efficiently.
ACM Trans. Algorithms, 2010

Semidefinite Relaxation of Quadratic Optimization Problems.
IEEE Signal Process. Mag., 2010

Lower Bound Theory of Nonzero Entries in Solutions of ℓ2-ℓp Minimization.
SIAM J. Scientific Computing, 2010

Universal Rigidity and Edge Sparsification for Sensor Network Localization.
SIAM Journal on Optimization, 2010

Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems.
Operations Research, 2010

On Sensor Network Localization Using SDP Relaxation
CoRR, 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

Correlation Robust Stochastic Optimization.
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

2009
Solving Large Scale and Sparse Semidefinite Programs.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Potential Reduction Methods for Linear Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Graph Realization via Semidefinite Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Semidefinite Programming and the Sensor Network Localization Problem, SNLP.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations.
SIAM Journal on Optimization, 2009

An edge-reduction algorithm for the vertex cover problem.
Oper. Res. Lett., 2009

Stochastic Combinatorial Optimization with Controllable Risk Aversion Level.
Math. Oper. Res., 2009

Budget Allocation in a Competitive Communication Spectrum Economy.
EURASIP J. Adv. Sig. Proc., 2009

Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit
CoRR, 2009

Distributionally Robust Stochastic Programming with Binary Random Variables
CoRR, 2009

A unified framework for dynamic pari-mutuel information market design.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

2008
Algorithm 875: DSDP5 - software for semidefinite programming.
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. Scientific Computing, 2008

Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization.
SIAM Journal on Optimization, 2008

A path to the Arrow-Debreu competitive market equilibrium.
Math. Program., 2008

A Unified Theorem on SDP Rank Reduction.
Math. Oper. Res., 2008

Learning to rank with combinatorial Hodge theory
CoRR, 2008

Stochastic Combinatorial Optimization under Probabilistic Constraints
CoRR, 2008

Parimutuel Betting on Permutations
CoRR, 2008

Preface.
Algorithmica, 2008

Computational Economy Equilibrium and Application.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

2007
Greedy Algorithms for Metric Facility Location Problems.
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

Approximating the Radii of Point Sets.
SIAM J. Comput., 2007

On approximating complex quadratic optimization problems via semidefinite programming relaxations.
Math. Program., 2007

Theory of semidefinite programming for Sensor Network Localization.
Math. Program., 2007

A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs
CoRR, 2007

Pari-Mutuel Markets: Mechanisms and Performance.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

A Note on Equilibrium Pricing as Convex Optimization.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

2006
Semidefinite programming based algorithms for sensor network localization.
TOSN, 2006

Semidefinite Programming Approaches for Sensor Network Localization With Noisy Distance Measurements.
IEEE Trans. Automation Science and Engineering, 2006

SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization.
SIAM Journal on Optimization, 2006

Approximation Algorithms for Metric Facility Location Problems.
SIAM J. Comput., 2006

Lot-sizing scheduling with batch setup times.
J. Scheduling, 2006

Improved complexity results on solving real-number linear feasibility problems.
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

A New Complexity Result on Solving the Markov Decision Problem.
Math. Oper. Res., 2005

On solving univariate sparse polynomials in logarithmic time.
J. Complexity, 2005

Leontief Economies Encode Nonzero Sum Two-Player Games
Electronic Colloquium on Computational Complexity (ECCC), 2005

On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams.
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

Computing the Arrow-Debreu Competitive Market Equilibrium and Its Extensions.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem.
SIAM J. Discrete Math., 2004

Improved approximations for max set splitting and max NAE SAT.
Discrete Applied Mathematics, 2004

Semidefinite programming for ad hoc wireless sensor network localization.
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

2003
SIAM Journal on Optimization, 2003

Approximating the 2-catalog segmentation problem using semidefinite programming relaxations.
Optimization Methods and Software, 2003

Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection.
J. Global Optimization, 2003

An approximation algorithm for scheduling two parallel machines with capacity constraints.
Discrete Applied Mathematics, 2003

Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Optimization with few violated constraints for linear bounded error parameter estimation.
IEEE Trans. Automat. Contr., 2002

A note on the maximization version of the multi-level facility location problem.
Oper. Res. Lett., 2002

On some interior-point algorithms for nonconvex quadratic optimization.
Math. Program., 2002

An improved rounding method and semidefinite programming relaxation for graph partition.
Math. Program., 2002

On approximation of max-vertex-cover.
European Journal of Operational Research, 2002

Improved Approximation Algorithms for Metric Facility Location Problems.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
Blind channel equalization and ϵ-approximation algorithms.
IEEE Trans. Signal Processing, 2001

A .699-approximation algorithm for Max-Bisection.
Math. Program., 2001

Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems.
Math. Program., 2001

2000
Convergence results of the analytic center estimator.
IEEE Trans. Automat. Contr., 2000

An Efficient Algorithm for Minimizing a Sum of p-Norms.
SIAM Journal on Optimization, 2000

On Smoothing Methods for the P[sub 0] Matrix Linear Complementarity Problem.
SIAM Journal on Optimization, 2000

Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization.
SIAM Journal on Optimization, 2000

1999
Bounded error parameter estimation: a sequential analytic center approach.
IEEE Trans. Automat. Contr., 1999

Constrained logarithmic least squares in parameter estimation.
IEEE Trans. Automat. Contr., 1999

Math. Program., 1999

Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems.
Math. Program., 1999

On a homogeneous algorithm for the monotone complementarity problem.
Math. Program., 1999

Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming.
Math. Oper. Res., 1999

J. Global Optimization, 1999

On quadratic convergence of the O(√nK)-iteration homogeneous and self‐duallinear programming algorithm.
Annals OR, 1999

1998
On the complexity of approximating a KKT point of quadratic programming.
Math. Program., 1998

Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming.
Math. Program., 1998

J. Comb. Optim., 1998

A Computational Study of the Homogeneous Algorithm for Large-scale Convex Optimization.
Comp. Opt. and Appl., 1998

Analytic center approach to parameter estimation: convergence analysis.
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
An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications.
SIAM Journal on Optimization, 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 Journal on Optimization, 1996

Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems.
SIAM Journal on Optimization, 1996

On homogeneous and self-dual algorithms for LCP.
Math. Program., 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

How Partial Knowledge Helps to Solve Linear Programs.
J. Complexity, 1996

A simplified homogeneous and self-dual linear programming algorithm and its implementation.
Annals OR, 1996

Identifying an optimal basis in linear programming.
Annals OR, 1996

A lower bound on the number of iterations of long-step primal-dual linear programming algorithms.
Annals OR, 1996

1995
A generalized homogeneous and self-dual algorithm for linear programming.
Oper. Res. Lett., 1995

Condition numbers for polyhedra with real number data.
Oper. Res. Lett., 1995

On the convergence of the iteration sequence in primal-dual interior-point methods.
Math. Program., 1995

On the Von Neumann Economic Growth Problem.
Math. Oper. Res., 1995

A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming.
Math. Oper. Res., 1995

Specially Structured Uncapacitated Facility Location Problems.
Operations Research, 1995

1994
Interior-Point Polynomial Algorithms in Convex Programming (Y. Nesterov and A. Nemirovskii).
SIAM Review, 1994

A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar's Potential Function.
SIAM Journal on Optimization, 1994

An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm.
Math. Oper. Res., 1994

Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming.
Math. Oper. Res., 1994

Combining Binary Search and Newton's Method to Compute Real Roots for a Class of Real Functions.
J. Complexity, 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
A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems.
SIAM Journal on Optimization, 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

Finding an interior point in the optimal face of linear programs.
Math. Program., 1993

Convergence behavior of interior-point algorithms.
Math. Program., 1993

A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem.
Math. Oper. Res., 1993

On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming.
Math. Oper. Res., 1993

1992
A Potential Reduction Algorithm Allowing Column Generation.
SIAM Journal on Optimization, 1992

On the finite convergence of interior-point algorithms for linear programming.
Math. Program., 1992

On affine scaling algorithms for nonconvex quadratic programming.
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

Comparative analysis of affine scaling algorithms based on simplifying assumptions.
Math. Program., 1991

An O(n3L) potential reduction algorithm for linear programming.
Math. Program., 1991

1990
A Class of Projective Transformations for Linear Programming.
SIAM J. Comput., 1990

Containing and Shrinking Ellipsoids in the Path-Following Algorithm.
Math. Program., 1990

A "Build-Down" Scheme for Linear Programming.
Math. Program., 1990

Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming.
Math. Oper. Res., 1990

A Centered Projective Algorithm for Linear Programming.
Math. Oper. Res., 1990

1989
An extension of Karmarkar's projective algorithm for convex quadratic programming.
Math. Program., 1989

1987
Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming.
Math. Program., 1987