The following pages link to Yinyu Ye (Q173845):
Displaying 44 items.
- (Q5492525) (← links)
- (Q5494208) (← links)
- (Q5688508) (← links)
- Minimal Adjustment Costs and the Optimal Choice of Inputs Under Time-of-Use Electricity Rates (Q5689381) (← links)
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem (Q5704227) (← links)
- A New Complexity Result on Solving the Markov Decision Problem (Q5704247) (← links)
- Algorithmic Applications in Management (Q5710114) (← links)
- Integer Programming and Combinatorial Optimization (Q5712455) (← links)
- The simplex method is strongly polynomial for deterministic Markov decision processes (Q5741814) (← links)
- Distributed Stochastic Optimization with Large Delays (Q5868949) (← links)
- Stochastic Combinatorial Optimization with Controllable Risk Aversion Level (Q5895001) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900928) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900932) (← links)
- Stochastic Combinatorial Optimization with Controllable Risk Aversion Level (Q5901345) (← links)
- Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems (Q5930724) (← links)
- A .699-approximation algorithm for Max-Bisection. (Q5930726) (← links)
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent (Q5962713) (← links)
- Simple and fast algorithm for binary integer and online linear programming (Q6160284) (← links)
- Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms (Q6176737) (← links)
- A one-phase interior point method for nonconvex optimization (Q6296230) (← links)
- Near-Optimal Time and Sample Complexities for Solving Discounted Markov Decision Process with a Generative Model (Q6302549) (← links)
- High-Dimensional Learning under ApproximateSparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks (Q6314905) (← links)
- SOLNP+: A Derivative-Free Solver for Constrained Nonlinear Optimization (Q6413857) (← links)
- A Homogeneous Second-Order Descent Method for Nonconvex Optimization (Q6417349) (← links)
- Homogeneous Second-Order Descent Framework: A Fast Alternative to Newton-Type Methods (Q6442089) (← links)
- Learning to Pivot as a Smart Expert (Q6447543) (← links)
- Linear and Nonlinear Programming (Q6486096) (← links)
- How a Small Amount of Data Sharing Benefits Distributed Optimization and Learning (Q6506440) (← links)
- From an Interior Point to a Corner Point: Smart Crossover (Q6507542) (← links)
- An Enhanced ADMM-based Interior Point Method for Linear and Conic Optimization (Q6508004) (← links)
- A Universal Trust-Region Method for Convex and Nonconvex Optimization (Q6514421) (← links)
- cuPDLP-C: A Strengthened Implementation of cuPDLP for Linear Programming by C language (Q6515274) (← links)
- A Tuning-Free Primal-Dual Splitting Algorithm for Large-Scale Semidefinite Programming (Q6519844) (← links)
- A Low-Rank ADMM Splitting Approach for Semidefinite Programming (Q6526036) (← links)
- Adaptive discrete phase retrieval (Q6538731) (← links)
- A Riemannian dimension-reduced second-order method with application in sensor network localization (Q6562381) (← links)
- Technical note -- An improved analysis of LP-based control for revenue management (Q6580515) (← links)
- Data-driven aerodynamic shape design with distributionally robust optimization approaches (Q6588278) (← links)
- Efficient reinforcement learning with impaired observability: learning to act with delayed and missing state observations (Q6670186) (← links)
- Restarted Primal-Dual Hybrid Conjugate Gradient Method for Large-Scale Quadratic Programming (Q6730065) (← links)
- A Single-Loop Robust Policy Gradient Method for Robust Markov Decision Processes (Q6730994) (← links)
- Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU (Q6737342) (← links)
- Orientation Determination of Cryo-EM Images Using Block Stochastic Riemannian Subgradient Methods (Q6754421) (← links)
- When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? (Q6754885) (← links)
