The following pages link to Yinyu Ye (Q173845):
Displaying 50 items.
- (Q4323620) (← links)
- (Q4353528) (← links)
- Combining Interior-Point and Pivoting Algorithms for Linear Programming (Q4361490) (← links)
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications (Q4376153) (← links)
- (Q4382667) (← links)
- (Q4411290) (← links)
- New Results on Quadratic Minimization (Q4441956) (← links)
- (Q4449171) (← links)
- (Q4496017) (← links)
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization (Q4504791) (← links)
- Constrained logarithmic least squares in parameter estimation (Q4506643) (← links)
- Bounded error parameter estimation: a sequential analytic center approach (Q4506803) (← links)
- Convergence results of the analytic center estimator (Q4507077) (← links)
- (Q4517108) (← links)
- (Q4527186) (← links)
- Dynamic Spectrum Management With the Competitive Market Model (Q4570227) (← links)
- Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes (Q4607932) (← links)
- (Q4633050) (← links)
- Approximating the 2-catalog segmentation problem using semidefinite programming relaxations (Q4650629) (← links)
- Improved Combinatorial Approximation Algorithms for the <i>k</i>-Level Facility Location Problem (Q4652631) (← links)
- On Doubly Positive Semidefinite Programming Relaxations (Q4688180) (← links)
- (Q4717969) (← links)
- (Q4718701) (← links)
- (Q4822033) (← links)
- A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming (Q4835390) (← links)
- (Q4840108) (← links)
- On the Von Neumann Economic Growth Problem (Q4864876) (← links)
- An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods (Q4895609) (← links)
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems (Q4895614) (← links)
- Specially Structured Uncapacitated Facility Location Problems (Q4897078) (← links)
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization (Q4943939) (← links)
- An Efficient Algorithm for Minimizing a Sum of <i>p</i>-Norms (Q4943943) (← links)
- An ADMM-based interior-point method for large-scale linear programming (Q4999335) (← links)
- MULTILEVEL MONTE CARLO SAMPLING ON HETEROGENEOUS COMPUTER ARCHITECTURES (Q5052419) (← links)
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (Q5058054) (← links)
- High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks (Q5060495) (← links)
- Modern optimization theory and applications (Q5064210) (← links)
- On the Efficiency of Random Permutation for ADMM and Coordinate Descent (Q5108265) (← links)
- Towards solving 2-TBSG efficiently (Q5135251) (← links)
- Analytical Results and Efficient Algorithm for Optimal Portfolio Deleveraging with Market Impact (Q5166308) (← links)
- (Q5202843) (← links)
- (Q5202847) (← links)
- Optimization with few violated constraints for linear bounded error parameter estimation (Q5267133) (← links)
- A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem (Q5287986) (← links)
- Newsvendor optimization with limited distribution information (Q5299917) (← links)
- (Q5324200) (← links)
- Blind channel equalization and ε-approximation algorithms (Q5353571) (← links)
- (Q5393827) (← links)
- (Q5417692) (← links)
- SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization (Q5426899) (← links)
