Yinyu Ye

Q: What Schools Are Affiliated With Yinyu Ye

Yinyu Ye is affiliated with the following schools: University of California, Berkeley, University of California, Santa Barbara, Stanford University, University of Iowa, Fudan University, University of California, Santa Cruz

Yinyu Ye's AcademicInfluence.com Rankings

Yinyu Ye

Computer Science

#672

World Rank

#693

Historical Rank

#362

USA Rank

Theoretical Computer Science

#44

World Rank

#44

Historical Rank

#14

USA Rank

computer-science Degrees

Yinyu Ye

Mathematics

#1280

World Rank

#2137

Historical Rank

#532

USA Rank

Operations Research

World Rank

Historical Rank

USA Rank

Game Theory

#12

World Rank

#14

Historical Rank

USA Rank

Measure Theory

#435

World Rank

#625

Historical Rank

#185

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Yinyu Ye's Degrees

PhD Operations Research Stanford University
Masters Operations Research Stanford University
Bachelors Mathematics Fudan University

Similar Degrees You Can Earn

Best Online Bachelor's in Math Ranked

Why Is Yinyu Ye Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Yinyu Ye is a Chinese American theoretical computer scientist working on mathematical optimization. He is a specialist in interior point methods, especially in convex minimization and linear programming. He is a professor of Management Science and Engineering and Kwoh-Ting Li Chair Professor of Engineering at Stanford University. He also holds a courtesy appointment in the Department of Electrical Engineering. Ye also is a co-founder of minMax Optimization Inc.

(See a Problem?)

Yinyu Ye's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Semidefinite Relaxation of Quadratic Optimization Problems (2010) (2585)
Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems (2010) (1448)
Linear and Nonlinear Programming (2021) (1332)
Interior point algorithms - theory and analysis (1997) (911)
Disciplined Convex Programming (2006) (820)
Semidefinite programming for ad hoc wireless sensor network localization (2004) (652)
The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent (2016) (612)
Semidefinite programming based algorithms for sensor network localization (2006) (574)
Semidefinite Programming Approaches for Sensor Network Localization With Noisy Distance Measurements (2006) (470)
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming (1993) (440)
Theory of semidefinite programming for Sensor Network Localization (2005) (433)
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm (1994) (387)
Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization (1999) (329)
Statistical ranking and combinatorial Hodge theory (2008) (322)
Lower Bound Theory of Nonzero Entries in Solutions of ℓ2-ℓp Minimization (2010) (316)
New Results on Quadratic Minimization (2003) (286)
A Dynamic Near-Optimal Algorithm for Online Linear Programming (2009) (274)
An O(n3L) potential reduction algorithm for linear programming (1991) (255)
A note on the complexity of Lp minimization (2011) (253)
Approximation algorithms for facility location problems (2004) (241)
Improved Approximation Algorithms for Metric Facility Location Problems (2002) (231)
Approximating quadratic programming with bound and quadratic constraints (1999) (196)
Approximation Algorithms for Metric Facility Location Problems (2006) (195)
An extension of Karmarkar's projective algorithm for convex quadratic programming (1989) (195)
The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate (2011) (193)
On approximating complex quadratic optimization problems via semidefinite programming relaxations (2005) (182)
Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization (2008) (177)
A unified framework for dynamic pari-mutuel information market design (2009) (176)
Likelihood robust optimization for data-driven problems (2013) (176)
Convergence behavior of interior-point algorithms (1993) (174)
A Centered Projective Algorithm for Linear Programming (1990) (163)
A primal-dual interior point method whose running time depends only on the constraint matrix (1996) (153)
Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems (2014) (150)
An infeasible interior-point algorithm for solving primal and dual geometric programs (1997) (147)
Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations (2009) (143)
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems (1996) (135)
Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model (2018) (135)
On affine scaling algorithms for nonconvex quadratic programming (1992) (133)
A path to the Arrow–Debreu competitive market equilibrium (2007) (133)
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem (2005) (131)
An Optimization Approach to Improving Collections of Shape Maps (2011) (127)
Complexity of unconstrained $$L_2-L_p$$ minimization (2011) (126)
A simplified homogeneous and self-dual linear programming algorithm and its implementation (1996) (124)
A quadratically convergent O( $$\sqrt n $$ L)-iteration algorithm for linear programming (1993) (118)
A .699-approximation algorithm for Max-Bisection (2001) (116)
An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications (1997) (114)
A Distributed Method for Solving Semidefinite Programs Arising from Ad Hoc Wireless Sensor Network Localization (2006) (112)
Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (2015) (110)
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes (2017) (109)
On the finite convergence of interior-point algorithms for linear programming (1992) (109)
Interior Algorithms for Linear, Quadratic, and Linearly Constrained Convex Programming (1997) (109)
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation (2008) (107)
On quadratic and $$O\left( {\sqrt {nL} } \right)$$ convergence of a predictor—corrector algorithm for LCP (1993) (107)
Semidefinite programming relaxations of nonconvex quadratic optimization (2000) (104)
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems (1999) (102)
Price of Correlations in Stochastic Optimization (2012) (100)
On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams (2005) (99)
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem (2003) (97)
On a homogeneous algorithm for the monotone complementarity problem (1999) (97)
On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities (1999) (92)
SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization (2006) (90)
A Class of Linear Complementarity Problems Solvable in Polynomial Time (1991) (88)
An Efficient Algorithm for Minimizing a Sum of p-Norms (1999) (86)
Complexity of Unconstrained L2-Lp Minimization (2011) (85)
Further Relaxations of the SDP Approach to Sensor Network Localization (2007) (85)
Leontief economies encode nonzero sum two-player games (2006) (83)
Semidefinite Relaxations, Multivariate Normal Distributions, and Order Statistics (1998) (81)
Approximation Algorithms for Quadratic Programming (1998) (81)
Finding an interior point in the optimal face of linear programs (1993) (77)
Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming (1987) (76)
Beyond convex relaxation: A polynomial-time non-convex optimization approach to network localization (2013) (74)
An interior point potential reduction algorithm for the linear complementarity problem (1992) (74)
An improved rounding method and semidefinite programming relaxation for graph partition (2002) (74)
A New Complexity Result on Solving the Markov Decision Problem (2005) (74)
A Gradient Search Method to Round the Semideflnite Programming Relaxation Solution for Ad Hoc Wireless Sensor Network Localization (2004) (72)
A Potential Reduction Algorithm Allowing Column Generation (1992) (72)
Interior-point methods for nonlinear complementarity problems (1996) (71)
A Unified Theorem on Sdp Rank Reduction (2006) (71)
Market equilibria for homothetic, quasi-concave utilities and economies of scale in production (2005) (70)
Algorithms for the solution of quadratic knapsack problems (1991) (70)
A homogeneous interior-point algorithm for nonsymmetric convex conic optimization (2015) (69)
A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem (1993) (68)
A new complexity result on minimization of a quadratic function with a sphere constraint (1992) (68)
On Homotopy-Smoothing Methods for Variational Inequalities (1999) (67)
A Computational Study of the Homogeneous Algorithm for Large-scale Convex Optimization (1998) (64)
Complexity analysis of the analytic center cutting plane method that uses multiple cuts (1997) (63)
Using total-variation regularization for intensity modulated radiation therapy inverse planning with field-specific numbers of segments (2008) (62)
A Note on the Complexity of L p Minimization (2009) (61)
Exchange market equilibria with Leontief's utility: Freedom of pricing leads to rationality (2007) (60)
On the complexity of approximating a KKT point of quadratic programming (1998) (59)
Bounded error parameter estimation: a sequential analytic center approach (1997) (59)
Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity (2019) (59)
A “build-down” scheme for linear programming (1990) (58)
Newsvendor optimization with limited distribution information (2013) (57)
Universal Rigidity: Towards Accurate and Efficient Localization of Wireless Networks (2010) (57)
Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments (2008) (56)
A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract) (2004) (53)
A semidefinite programming approach to tensegrity theory and realizability of graphs (2006) (52)
On some efficient interior point methods for nonlinear convex programming (1991) (51)
The cubic spherical optimization problems (2012) (51)
Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (2018) (50)
A Class of Projective Transformations for Linear Programming (1990) (49)
Combining Interior-Point and Pivoting Algorithms for Linear Programming (1996) (49)
Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming (1994) (48)
Sequential Batch Learning in Finite-Action Linear Contextual Bandits (2020) (48)
Low-Rank Semidefinite Programming: Theory and Applications (2016) (47)
Condition numbers for polyhedra with real number data (1995) (46)
Approximating Global Quadratic Optimization with Convex Quadratic Constraints (1999) (45)
Distributed Asynchronous Optimization with Unbounded Delays: How Slow Can You Go? (2018) (45)
On the Expected Convergence of Randomly Permuted ADMM (2015) (45)
Correlation robust stochastic optimization (2009) (45)
Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (2013) (44)
Combining Binary Search and Newton's Method to Compute Real Roots for a Class of Real Functions (1994) (43)
On homogeneous and self-dual algorithms for LCP (1997) (43)
Algorithm 875: DSDP5—software for semidefinite programming (2008) (42)
Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (2019) (42)
The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes (2012) (42)
Near-Optimal Time and Sample Complexities for Solving Discounted Markov Decision Process with a Generative Model (2018) (42)
HDSDP: Software for Semidefinite Programming (2022) (41)
Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (2015) (41)
Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions (2017) (41)
An approximation algorithm for scheduling aircraft with holding time (2004) (41)
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (2017) (41)
Dynamic Spectrum Management With the Competitive Market Model (2010) (40)
A convergent algorithm for quantile regression with smoothing splines (1995) (40)
DSDP5 user guide - software for semidefinite programming. (2006) (40)
An Asymptotical O(√(n) L)-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods (1996) (40)
Semidefinite Programming Algorithms for Sensor Network Localization using Angle Information (2005) (39)
A Dynamic Algorithm for Facilitated Charging of Plug-In Electric Vehicles (2011) (39)
Solving Sparse Semidefinite Programs Using the Dual Scaling Algorithm with an Iterative Solver (2000) (39)
Integration of Angle of Arrival Information for Multimodal Sensor Network Localization using Semidefinite Programming (2005) (38)
Specially Structured Uncapacitated Facility Location Problems (1995) (38)
Optimization with few violated constraints for linear bounded error parameter estimation (2002) (38)
Sparse Portfolio Selection via Quasi-Norm Regularization (2013) (38)
Universal Rigidity and Edge Sparsification for Sensor Network Localization (2010) (37)
On Smoothing Methods for the P[sub 0] Matrix Linear Complementarity Problem (2000) (36)
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems (2001) (36)
MILP formulation and polynomial time algorithm for an aircraft scheduling problem (2003) (36)
Linear operators and positive semidefiniteness of symmetric tensor spaces (2015) (33)
Sensors: Theory, Algorithms, and Applications (2011) (33)
Waterflood management using two-stage optimization with streamline simulation (2014) (33)
A Mathematical Programming Formulation for Optimal Load Shifting of Electricity Demand for the Smart Grid (2020) (33)
An ADMM-based interior-point method for large-scale linear programming (2018) (32)
Simple and Fast Algorithm for Binary Integer and Online Linear Programming (2020) (32)
Improved approximations for max set splitting and max NAE SAT (2004) (31)
A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems (1993) (31)
A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming (1995) (31)
On approximation of max-vertex-cover (2002) (31)
On the Complexity of a Column Generation Algorithm for Convex or Quasiconvex Feasibility Problems (1994) (31)
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (1998) (30)
Eliminating columns in the simplex method for linear programming (1989) (30)
Containing and shrinking ellipsoids in the path-following algorithm (1990) (30)
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (1997) (30)
On affine motions and bar frameworks in general position (2010) (30)
Karmarkar's algorithm and the ellipsoid method (1987) (30)
A Levenberg-Marquardt method with approximate projections (2014) (28)
Solution of P 0 -matrix linear complementarity problems using a potential reduction algorithm (1993) (27)
Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection (2003) (27)
A generalized homogeneous and self-dual algorithm for linear programming (1995) (27)
An extension of Karmarkar's algorithm and the trust region method for quadratic programming (1989) (27)
A Note on Equilibrium Pricing as Convex Optimization (2007) (27)
A Unified Framework for Dynamic Prediction Market Design (2011) (26)
Pari-Mutuel Markets: Mechanisms and Performance (2007) (25)
Worst-case Complexity of Cyclic Coordinate Descent: $O(n^2)$ Gap with Randomized Version (2016) (25)
Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming (1999) (25)
Semidefinite Programming Algorithms for Sensor Network Localization using Angle of Arrival Information (2005) (24)
ON THE SOLUTION OF INDEFINITE QUADRATIC PROBLEMS USING AN INTERIOR-POINT ALGORITHM (1992) (24)
An O(square-root[nL])-Iteration Homogeneous and Self-Dual Linear Programming Algorithm (1992) (24)
Budget Allocation in a Competitive Communication Spectrum Economy (2009) (23)
A Build-Up Interior Method for Linear Programming: Affine Scaling Form (1990) (23)
Approximating Quadratic Programming With Bound Constraints (1997) (23)
A Surface of Analytic Centers and Infeasible- Interior-Point Algorithms for Linear Programming (1993) (23)
Learning in Games with Lossy Feedback (2018) (22)
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (1996) (22)
Approximating Maximum Stable Set and Minimum Graph Coloring Problems with the Positive Semidefinite Relaxation (2001) (22)
Finding equitable convex partitions of points in a polygon efficiently (2010) (22)
The complexity of equilibria: Hardness results for economies via a correspondence with games (2008) (22)
Interior-Point Methods Strike Back: Solving the Wasserstein Barycenter Problem (2019) (22)
On the Efficiency of Random Permutation for ADMM and Coordinate Descent (2015) (21)
An interior-point algorithm for large-scale quadratic problems with box constraints (1990) (21)
The Value of Stochastic Modeling in Two-Stage Stochastic Programs with Cost Uncertainty (2012) (21)
A Short-Cut Potential Reduction Algorithm for Linear Programming (1993) (21)
Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions (2015) (21)
Close the Gaps: A Learning-while-Doing Algorithm for a Class of Single-Product Revenue Management Problems (2011) (21)
Space tensor conic programming (2014) (20)
Analytical Results and Efficient Algorithm for Optimal Portfolio Deleveraging with Market Impact (2013) (20)
On stress matrices of (d + 1)-lateration frameworks in general position (2013) (20)
The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate (2010) (20)
Parimutuel Betting on Permutations (2008) (20)
Approximating the Radii of Point Sets (2007) (19)
Average Performance of a Self–Dual Interior Point Algorithm for Linear Programming (1993) (19)
Lot-sizing scheduling with batch setup times (2006) (19)
A note on the maximization version of the multi-level facility location problem (2002) (19)
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level (2006) (19)
Interior-Point Polynomial Algorithms in Convex Programming (Y. Nesterov and A. Nemirovskii) (1994) (18)
Approximating the 2-catalog segmentation problem using semidefinite programming relaxations (2003) (17)
An approximation algorithm for scheduling two parallel machines with capacity constraints (2003) (17)
A fixed point iterative approach to integer programming and its distributed computation (2015) (17)
Conditions for Correct Sensor Network Localization Using SDP Relaxation (2013) (17)
DSDP3: dual scaling algorithm for general positive semidefinite programming. (2001) (17)
A Build-up Interior-point Method for Linear Programming: Aane Scaling Form (1991) (17)
On solving univariate sparse polynomials in logarithmic time (2005) (16)
The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent (2014) (16)
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (2017) (16)
A Primal-Dual Accelerated Interior Point Method Whose Running Time Depends Only on A (1994) (16)
Distributionally Robust Local Non-parametric Conditional Estimation (2020) (16)
Approximation Hardness for A Class of Sparse Optimization Problems (2019) (16)
A one-phase interior point method for nonconvex optimization (2018) (15)
Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit (2009) (15)
Simultaneous beam sampling and aperture shape optimization for SPORT. (2015) (15)
On the Convergence of Multi-Block Alternating Direction Method of Multipliers and Block Coordinate Descent Method (2015) (14)
On the convergence of the iteration sequence in primal-dual interior-point methods (1995) (13)
Near boundary behavior of primal—dual potential reduction algorithms for linear programming (1993) (13)
Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming (1990) (13)
Nonconvex Quadratic Optimization , Semidefinite Relaxation , and Applications (2009) (13)
A Lower Bound on the Number of Iterations of Long-Step and Polynomial Interior-Point Linear Programming Algorithms (1994) (13)
Worst-case complexity of cyclic coordinate descent: $$O(n^2)$$ O ( n 2 ) (2016) (13)
Conceptual formulation on four-dimensional inverse planning for intensity modulated radiation therapy (2009) (13)
Implementation of interior-point algorithms for some entropy optimization problems (1992) (13)
Identifying an optimal basis in linear programming (1996) (13)
An accelerated interior point method whose running time depends only on A (extended abstract) (1993) (13)
Probabilistic analysis of two complexity measures for linear programming problems (1998) (12)
A FPTAS for computing a symmetric Leontief competitive economy equilibrium (2008) (12)
Application of Semidefinite Programming to Circuit Partitioning (2000) (12)
Optimal Arrival Traffic Spacing via Dynamic Programming (2004) (12)
An interior-point path-following algorithm for computing a Leontief economy equilibrium (2011) (12)
Robustifying Conditional Portfolio Decisions via Optimal Transport (2021) (11)
A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar's Potential Function (1994) (11)
Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming (2019) (11)
Strong NP-Hardness Result for Regularized $L_q$-Minimization Problems with Concave Penalty Functions (2015) (11)
Hidden-City Ticketing: The Cause and Impact (2016) (11)
Blind channel equalization and ϵ-approximation algorithms (2001) (11)
Further Development on the Interior Algorithm for Convex Quadratic Programming (1987) (11)
A Convex Parimutuel Formulation for Contingent Claim Markets (2006) (11)
A Simplification to “A Primal-Dual Interior Point Method Whose Running Time Depends Only on the Constraint Matrix” (1996) (10)
Minimal adjustment costs, factor demands, and seasonal time-of-use electricity rates☆ (1993) (10)
Learning to rank with combinatorial Hodge theory (2008) (10)
Improved complexity results on solving real-number linear feasibility problems (2006) (10)
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (2019) (10)
Discrete geometry and optimization (2013) (10)
Analytic center approach to parameter estimation: convergence analysis (1998) (10)
Linear Programming and Condition Numbers under the Real Number Computation Model (2003) (9)
A Genuine Quadratically Convergent Polynomial Interior Point Algorithm for Linear Programming (1994) (9)
Competitive Communication Spectrum Economy and Equilibrium (2014) (9)
The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks (2021) (9)
Interior-point algorithms for global optimization (1991) (9)
Geometric rounding: a dependent randomized rounding scheme (2011) (9)
Assessing the System Value of Optimal Load Shifting (2018) (9)
A Mathematical Formulation for Optimal Load Shifting of Electricity Demand (2015) (9)
Anticipated Behavior of Path-Following Algorithms for Linear Programming (1989) (8)
A novel fluence map optimization model incorporating leaf sequencing constraints (2010) (8)
On quadratic convergence of the $$O\left( {\sqrt {nL} } \right)$$ -iteration homogeneous and self‐duallinear programming algorithm (1999) (8)
On Sensor Network Localization Using SDP Relaxation (2010) (8)
Fisher Markets with Linear Constraints: Equilibrium Properties and Efficient Distributed Algorithms (2021) (8)
Basic Descent Methods (2021) (7)
Markets for Efficient Public Good Allocation with Social Distancing (2020) (7)
Computing the Arrow-Debreu Competitive Market Equilibrium and Its Extensions (2005) (7)
Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program (1991) (7)
Constrained logarithmic least squares in parameter estimation (1999) (7)
Convex Optimization in Signal Processing and Communications: Probabilistic analysis of semidefinite relaxation detectors for multiple-input, multiple-output systems (2009) (7)
A computation study on an integrated alternating direction method of multipliers for large scale optimization (2018) (7)
Web and Internet Economics: 10th International Conference, WINE 2014 Beijing, China, December 14-17, 2014 Proceedings (2014) (7)
On the Von Neumann Economic Growth Problem (1995) (7)
An extension of the potential reduction algorithm for linear complementarity problems with some priority goals (1993) (7)
Convergence results of the analytic center estimator (2000) (6)
Penalty and Barrier Methods (2021) (6)
How Linear Reward Helps in Online Resource Allocation (2021) (6)
Stochastic Combinatorial Optimization under Probabilistic Constraints (2008) (6)
Conic Linear Programming (2021) (6)
Integrated structural/controller optimization of large space structures (1988) (6)
DRSOM: A Dimension Reduced Second-Order Method and Preliminary Analyses (2022) (6)
On some interior-point algorithms for nonconvex quadratic optimization (2002) (6)
Minimal adjustment costs and the optimal choice of inputs under time-of-use electricity rates (1995) (6)
Web and Internet Economics (2014) (5)
Line Search in Potential Reduction Algorithms for Linear Programming (1989) (5)
An Improved Analysis of LP-Based Control for Revenue Management (2021) (5)
Comparative analysis of affine scaling algorithms based on simplifying assumptions (1991) (5)
Existence of Positive Steady States for Mass Conserving and Mass-Action Chemical Reaction Networks with a Single Terminal-Linkage Class (2011) (5)
On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering (2018) (5)
Distributed stochastic optimization with large delays (2021) (5)
Extensions of the potential reduction algorithm for linear programming (1992) (5)
ON EQUILIBRIUM PRICING AS CONVEX OPTIMIZATION (2010) (5)
Worst-case iteration bounds for log barrier methods for problems with nonconvex constraints (2018) (5)
The Fixed-Hub Single Allocation Problem: A Geometric Rounding Approach (2007) (5)
Conjugate Direction Methods (2021) (5)
Translational Cuts for Convex Minimization (1993) (5)
An edge-reduction algorithm for the vertex cover problem (2009) (4)
Geometric Rounding : A Dependent Rounding Scheme for Allocation Problems (2008) (4)
High-Dimensional Learning under Approximate Sparsity: A Unifying Framework for Nonsmooth Learning and Regularized Neural Networks (2019) (4)
Micro-Doppler Ambiguity Resolution Based on Short-Time Compressed Sensing (2015) (4)
Transportation and Network Flow Problems (2008) (4)
How Partial Knowledge Helps to Solve Linear Programs (1996) (4)
MULTILEVEL MONTE CARLO SAMPLING ON HETEROGENEOUS COMPUTER ARCHITECTURES (2020) (4)
A polynomial time log barrier method for problems with nonconvex constraints (2018) (4)
Online Allocation Rules in Display Advertising (2014) (4)
Diagonal Preconditioning: Theory and Algorithms (2020) (4)
Data Randomness Makes Optimization Problems Easier to Solve ? (2016) (4)
Basic Properties of Linear Programs (2021) (4)
Anticipated Behavior of Long-Step Algorithms for Linear Programming. (1990) (4)
Computations and Complexities of Tarski's Fixed Points and Supermodular Games (2020) (4)
Toward the Universal Rigidity of General Frameworks (2010) (4)
Boosting Method in Approximately Solving Linear Programming with Fast Online Algorithm (2021) (3)
Fairer LP-based Online Allocation via Analytic Center (2021) (3)
Correction to: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (2021) (3)
ON SOLVING FEWNOMIALS OVER INTERVALS IN FEWNOMIAL TIME (2001) (3)
On the Budgeted Max-cut Problem and Its Application to the Capacitated Two-parallel Machine Scheduling (2001) (3)
Semidefinite Programming and the Sensor Network Localization Problem, SNLP (2009) (3)
Predictor-corrector method for nonlinear complementarity problem (1997) (3)
Solving Large Scale and Sparse Semidefinite Programs (2009) (3)
Fuzzy control of stochastic global optimization algorithms and very fast simulated rean- nealing (2006) (3)
How Much is an Oil Price Forecast Worth in Reservoir Management (2014) (3)
An Adaptive State Aggregation Algorithm for Markov Decision Processes (2021) (2)
Open problems in sequential parametric estimation (1999) (2)
Greedy Algorithms for Metric Facility Location Problems (2007) (2)
A polynomial time 3-2-approximation algorithm for the vertex cover problem on a class of graphs (2007) (2)
Markets for Efficient Public Good Allocation (2020) (2)
Worst‐Case Analysis (2011) (2)
On Analyzing Semidefinite Programming Relaxations of Complex Quadratic Optimization Problems (2007) (2)
From an Interior Point to a Corner Point: Smart Crossover (2021) (2)
Selected Open Problems in Discrete Geometry and Optimization (2013) (2)
On a New SDP-SOCP Method for Acoustic Source Localization Problem (2016) (2)
Quadratic Programming over an Ellipsoid (2009) (2)
Linear Programming-Based Algorithms for the Fixed-Hub Single Allocation Problem (2007) (2)
On a Randomized Multi-Block ADMM for Solving Selected Machine Learning Problems (2019) (2)
Semidefinite Programming for Sensor Network and Graph Localization (2006) (2)
Recent results on the analytic center approach for bounded error parameter estimation (1999) (2)
Optimization and Engineering Applications (2007) (2)
Reservoir Management Using Two-stage Optimization with Streamline Simulation (2012) (2)
Wiley‐Interscience Series in Discrete Mathematics and Optimization (2011) (2)
Online Learning in Fisher Markets with Unknown Agent Preferences (2022) (2)
Primal-Dual Methods (2016) (1)
A homogeneous interior-point algorithm for nonsymmetric convex conic optimization (2014) (1)
Linear Programming Algorithms (2011) (1)
Linear operators and positive semidefiniteness of symmetric tensor spaces (2014) (1)
Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming (2018) (1)
Fine-grained Correlation Loss for Regression (2022) (1)
SU-E-T-295: Simultaneous Beam Sampling and Aperture Shape Optimization for Station Parameter Optimized Radiation Therapy (SPORT). (2014) (1)
MO‐D‐BRB‐02: Using Total‐Variation Regularization for IMRT Inverse Planning with Field‐Specific Numbers of Segments (2009) (1)
Multi-agent Online Learning with Asynchronous Feedback Loss (2018) (1)
.586 Approximation of Dense-n/2-Subgraph (1999) (1)
Towards solving 2-TBSG efficiently (2019) (1)
Linear and Nonlinear Programming 4th Edition (2020) (1)
A Mean-Field Theory for Learning the Schönberg Measure of Radial Basis Functions (2020) (1)
Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions (2017) (1)
A New Complexity Result on Solving the (2005) (1)
The least squares: output error sensitivity and the constrained logarithmic algorithm (1998) (1)
New Developments of ADMM-based Interior Point Methods for Linear Programming and Conic Programming (2022) (1)
A fixed point iterative approach to integer programming and its distributed computation (2015) (1)
Quasi-Newton Methods (2021) (1)
Cardinal Optimizer (COPT) User Guide (2022) (1)
Conic Descent and its Application to Memory-efficient Optimization over Positive Semidefinite Matrices (2020) (1)
Duality and Dual Methods (2016) (1)
Online Learning in Fisher Markets: Static Pricing Limits and Adaptive Enhancements (2022) (1)
A Robust Mechanism to Dynamically Provide Grid Services with a Fleet of Plug-in Electric Vehicles (2011) (1)
Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (2012) (1)
A Pseudo ∈-Approximate Algorithm For Feedback Vertex Set (1996) (1)
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] (2020) (1)
Constrained Minimization Conditions (2016) (1)
Interior-Point Methods (2021) (1)
Optimal Diagonal Preconditioning (2022) (0)
The Simplex Method (2021) (0)
Optimization Algorithms and Equilibrium Analysis for Dynamic Resource Allocation (2012) (0)
Preface (2007) (0)
Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements (2022) (0)
Fairer LP-based Online Allocation (2021) (0)
On stress matrices of (d + 1)-lateration frameworks in general position (2011) (0)
Fast Online Algorithms for Linear Programming (2021) (0)
Space tensor conic programming (2013) (0)
Potential Reduction Methods for Linear Programming (2009) (0)
Proceedings of the ACM International Workshop on Mobile Entity Localization and Tracking in GPS-less Environments, MELT 2008, San Francisco, California, USA, September 19, 2008 (2008) (0)
Competitive Communication Spectrum Economy and Equilibrium (2013) (0)
Local Duality and Dual Methods (2021) (0)
How a Small Amount of Data Sharing Benefits Distributed Optimization and Learning (2022) (0)
Introduction and Preliminaries (2011) (0)
Primal–Dual Methods (2021) (0)
Correction to: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (2021) (0)
Internet and Network Economics: First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005, Proceedings (Lecture Notes in Computer Science) (2006) (0)
Market Making with Model Uncertainty (2015) (0)
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (2020) (0)
CBCT Image Reconstruction via Anisotropic Total-variation Regularization (2009) (0)
Mixed-Integer Nonconvex Quadratic Optimization Relaxations and Performance Analysis (2016) (0)
Interior-point Algorithms: 1994 Annual Progress Report on Nsf Grant Ddm-9207347 (2007) (0)
High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks (2019) (0)
Average‐Case Analysis (2011) (0)
Distributionally Robust Stochastic Programming with Binary Random Variables (2009) (0)
Internet and Network Economics (vol. # 3828) : First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005, Proceedings (2005) (0)
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (2018) (0)
Geometry of Convex Inequalities (2011) (0)
Dual and Cutting Plane Methods (2008) (0)
Interior-point Algorithms: 1996 Annual Progress Report on Nsf Grant Dmi-9522507 (1998) (0)
Multi-Block ADMM and its Convergence (2015) (0)
Map segmentation algorithms for geographic resource allocation (2009) (0)
Primal Methods (2021) (0)
Optimizing Beam Angles and Aperture Shapes Simultaneously for Station Parameter Optimized Radiation Therapy (SPORT) (2014) (0)
Duality and Complementarity (2021) (0)
An O( P Nl)-iteration Combined Phase I-phase Ii Potential Reduction Algorithm for Linear Programming (1992) (0)
Fast Aperture-based Inverse Treatment Planning using Mixed Integer and Quadratic Optimization (2008) (0)
International Conference on the spectral theory of the tensor (2012) (0)
Optimal Diagonal Preconditioning: Theory and Practice (2022) (0)
Sensors: Theory, Algorithms, and Applications - Volume 61 (2014) (0)
Interior-point Algorithms: First Year Progress Report on Nsf Grant Ddm-9207347 (1995) (0)
Sparse Portfolio Selection via (2013) (0)
The Symmetry between Bandits and Knapsacks: A Primal-Dual LP-based Approach (2021) (0)
Proceedings of the First international conference on Internet and Network Economics (2005) (0)
A geometric framework for resource allocation problems (2009) (0)
Interior-point Algorithms: First Year Progress Report on Nsf Grant Ddm-8922636 1.1. Column Generation 1.2. Algorithm Termination (1995) (0)
Supplement to \Linear and Nonlinear Programming" (2005) (0)
Computational Economy Equilibrium and Application (2008) (0)
Probabilistic analysis of SDR detectors for MIMO systems (2010) (0)
A computation study on an integrated alternating direction method of multipliers for large scale optimization (2017) (0)
A Riemannian Dimension-reduced Second Order Method with Application in Sensor Network Localization (2023) (0)
Special Issue: The 3rd International Conference on Optimization Methods and Software (May 13-17, 2012, Chania, Greece) Foreword (2014) (0)
Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (2019) (0)
A review of: “Introduction to Linear Optimization”Dimitris Bertsimas and John Tsitsiklis 608 pages, ISBN 1-886529-19-1, $69.00 (hardback) (1998) (0)
A gradient descent akin method for constrained optimization: algorithms and applications (2023) (0)
Basic Properties of Solutions and Algorithms (2021) (0)
Localization based Ms-Mac Protocol to Enhance the Energy Efficiency in Sensor Networks (2018) (0)
SOLNP+: A Derivative-Free Solver for Constrained Nonlinear Optimization (2022) (0)
A Mean-Field Theory for Learning the Sch\"{o}nberg Measure of Radial Basis Functions (2020) (0)
Computation of Analytic Center (2011) (0)
Introduction (2021) (0)
A FPTAS for computing a symmetric Leontief competitive economy equilibrium (2010) (0)
A Quadratically Convergent 0 ( ynL )-Iteration Algorithm for Linear Programming (2003) (0)
A Homogeneous Second-Order Descent Method for Nonconvex Optimization (2022) (0)
SU‐F‐BRB‐11: An Integrated Alternating Direction Method of Multipliers for Treatment Planning Optimization (2015) (0)
Graph Realization via Semidefinite Programming (2009) (0)
On Approximating Facility Location and Related Problems (2002) (0)
On Doubly Positive Semidefinite Programming Relaxations Dongdong Ge (2010) (0)
The Complexity of Determining the Uniqueness of Tarski's Fixed Point under the Lexicographic Ordering (2010) (0)
Constrained Optimization Conditions (2021) (0)
A Derandomized Algorithm for RP-ADMM with Symmetric Gauss-Seidel Method (2017) (0)
Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (2017) (0)
.602 Approximation of the Complement of Min-Bisection and .519 Approximation of Dense-n/2-Subgraph (1999) (0)
Leontief Economy Equilibrium (2008) (0)
Adaptive Discrete Phase Retrieval (2020) (0)
Analytic center and maximum likelihood estimators (1998) (0)
Dsdp5 User Guide – Software for Semidefinite Programming * Contents Abstract 1 1 Notation 2 2 Dual-scaling Algorithm 3 3 Standard Form 5 4 Iteration Monitor 7 (2005) (0)

This paper list is powered by the following services:

Other Resources About Yinyu Ye

What Schools Are Affiliated With Yinyu Ye?

Yinyu Ye is affiliated with the following schools:

Yinyu Ye's Academic­Influence.com Rankings

Yinyu Ye's Degrees

Similar Degrees You Can Earn

Why Is Yinyu Ye Influential?

Yinyu Ye's Published Works

Published Works

Other Resources About Yinyu Ye

What Schools Are Affiliated With Yinyu Ye?

Yinyu Ye's AcademicInfluence.com Rankings