The following pages link to Yinyu Ye (Q173845):
Displaying 50 items.
- A fixed point iterative approach to integer programming and its distributed computation (Q288180) (← links)
- Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
- Competitive communication spectrum economy and equilibrium (Q489089) (← links)
- Statistical ranking and combinatorial Hodge theory (Q633110) (← links)
- A note on the complexity of \(L _{p }\) minimization (Q644905) (← links)
- A FPTAS for computing a symmetric leontief competitive economy equilibrium (Q662291) (← links)
- A convergent algorithm for quantile regression with smoothing splines (Q672955) (← links)
- A computation study on an integrated alternating direction method of multipliers for large scale optimization (Q683915) (← links)
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- (Q742290) (redirect page) (← links)
- A Levenberg-Marquardt method with approximate projections (Q742291) (← links)
- Space tensor conic programming (Q742309) (← links)
- An interior-point path-following algorithm for computing a Leontief economy equilibrium (Q763393) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (Q823888) (← links)
- An edge-reduction algorithm for the vertex cover problem (Q833573) (← links)
- Theory of semidefinite programming for sensor network localization (Q868476) (← links)
- On approximating complex quadratic optimization problems via semidefinite programming relaxations (Q877200) (← links)
- Lot-sizing scheduling with batch setup times (Q880550) (← links)
- Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality (Q883994) (← links)
- A ``build-down'' scheme for linear programming (Q912758) (← links)
- Linear and nonlinear programming. (Q935681) (← links)
- The complexity of equilibria: Hardness results for economies via a correspondence with games (Q959811) (← links)
- Budget allocation in a competitive communication spectrum economy (Q965456) (← links)
- Karmarkar's algorithm and the ellipsoid method (Q1095025) (← links)
- Eliminating columns in the simplex method for linear programming (Q1113797) (← links)
- An extension of Karmarkar's projective algorithm for convex quadratic programming (Q1121792) (← links)
- A class of linear complementarity problems solvable in polynomial time (Q1174838) (← links)
- Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program (Q1180819) (← links)
- Comparative analysis of affine scaling algorithms based on simplifying assumptions (Q1181906) (← links)
- On affine scaling algorithms for nonconvex quadratic programming (Q1196182) (← links)
- An interior point potential reduction algorithm for the linear complementarity problem (Q1196718) (← links)
- A computational study of the homogeneous algorithm for large-scale convex optimization (Q1273428) (← links)
- On quadratic convergence of the \(O(\sqrt nL)\)-iteration homogeneous and self-dual linear programming algorithm (Q1290212) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- Approximating global quadratic optimization with convex quadratic constraints (Q1304392) (← links)
- An extension of the potential reduction algorithm for linear complementarity problems with some priority goals (Q1318200) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
- Combining binary search and Newton's method to compute real roots for a class of real functions (Q1336478) (← links)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← links)
- On homogeneous and self-dual algorithms for LCP (Q1361111) (← links)
- Complexity analysis of the analytic center cutting plane method that uses multiple cuts (Q1373727) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- Approximation algorithms for quadratic programming (Q1386484) (← links)
- Predictor-corrector method for nonlinear complementarity problems (Q1387608) (← links)
