The following pages link to Yinyu Ye (Q173845):
Displaying 50 items.
- On some interior-point algorithms for nonconvex quadratic optimization (Q1396211) (← links)
- An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
- Approximating quadratic programming with bound and quadratic constraints (Q1572673) (← links)
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems (Q1572675) (← links)
- On a homogeneous algorithm for the monotone complementarity problem (Q1572684) (← links)
- On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering (Q1637226) (← links)
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions (Q1683689) (← links)
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (Q1717220) (← links)
- On solving univariate sparse polynomials in logarithmic time (Q1763426) (← links)
- Likelihood robust optimization for data-driven problems (Q1789597) (← links)
- On the convergence of the iteration sequence in primal-dual interior- point methods (Q1804356) (← links)
- Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection (Q1810886) (← links)
- Containing and shrinking ellipsoids in the path-following algorithm (Q1813834) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- An improved rounding method and semidefinite programming relaxation for graph partition (Q1849503) (← links)
- A note on the maximization version of the multi-level facility location problem (Q1866995) (← links)
- Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
- A generalized homogeneous and self-dual algorithm for linear programming (Q1904760) (← links)
- A simplified homogeneous and self-dual linear programming algorithm and its implementation (Q1915910) (← links)
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
- Identifying an optimal basis in linear programming (Q1915926) (← links)
- Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
- Condition numbers for polyhedra with real number data (Q1924613) (← links)
- On affine motions and bar frameworks in general position (Q1932577) (← links)
- On stress matrices of \((d + 1)\)-lateration frameworks in general position (Q1942275) (← links)
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
- Linear operators and positive semidefiniteness of symmetric tensor spaces (Q2018916) (← links)
- Optimization and operations research in mitigation of a pandemic (Q2158111) (← links)
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
- On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (Q2227537) (← links)
- Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs'' (Q2235166) (← links)
- A variational principle for computing nonequilibrium fluxes and potentials in genome-scale biochemical networks (Q2263480) (← links)
- Erratum/correction to: ``On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering'' (Q2309414) (← links)
- Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming (Q2330643) (← links)
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization (Q2340336) (← links)
- Linear and nonlinear programming (Q2354092) (← links)
- How partial knowledge helps to solve linear programs (Q2365419) (← links)
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming (Q2368076) (← links)
- Complexity of unconstrained \(L_2 - L_p\) minimization (Q2436652) (← links)
- A path to the Arrow-Debreu competitive market equilibrium (Q2467155) (← links)
- Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043) (← links)
- On smoothing methods for the \(P_{0}\) matrix linear complementarity problem (Q2706332) (← links)
- Average performance of a self-dual interior point algorithm for linear programming (Q2743961) (← links)
- Translational cuts for convex minimization (Q2743983) (← links)
- Probabilistic analysis of an infeasible-interior-point algorithm for linear programming (Q2757589) (← links)
- Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation (Q2760093) (← links)
- An accelerated interior point method whose running time depends only on \(A\) (extended abstract) (Q2817643) (← links)
