Year |
Citation |
Score |
2020 |
Sun R, Luo Z, Ye Y. On the Efficiency of Random Permutation for ADMM and Coordinate Descent Mathematics of Operations Research. 45: 233-271. DOI: 10.1287/Moor.2019.0990 |
0.397 |
|
2020 |
Dang C, Ye Y. 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] Theoretical Computer Science. 817: 80. DOI: 10.1016/J.Tcs.2019.03.014 |
0.364 |
|
2020 |
Burer S, Ye Y. Exact Semidefinite Formulations for a Class of (Random and Non-Random) Nonconvex Quadratic Programs Mathematical Programming. 181: 1-17. DOI: 10.1007/S10107-019-01367-2 |
0.401 |
|
2019 |
Liu H, Wang X, Yao T, Li R, Ye Y. Sample Average Approximation with Sparsity-Inducing Penalty for High-Dimensional Stochastic Programming. Mathematical Programming. 78: 69-108. PMID 31680704 DOI: 10.1007/S10107-018-1278-0 |
0.415 |
|
2019 |
Haeser G, Hinder O, Ye Y. On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods Mathematical Programming. 1-32. DOI: 10.1007/S10107-019-01454-4 |
0.431 |
|
2019 |
Haeser G, Liu H, Ye Y. Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary Mathematical Programming. 178: 263-299. DOI: 10.1007/S10107-018-1290-4 |
0.472 |
|
2019 |
Chen C, Li M, Liu X, Ye Y. Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights Mathematical Programming. 173: 37-77. DOI: 10.1007/S10107-017-1205-9 |
0.502 |
|
2018 |
Dang C, Ye Y. On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering Theoretical Computer Science. 732: 26-45. DOI: 10.1016/J.Tcs.2018.04.021 |
0.345 |
|
2018 |
Zarepisheh M, Xing L, Ye Y. A computation study on an integrated alternating direction method of multipliers for large scale optimization Optimization Letters. 12: 3-15. DOI: 10.1007/S11590-017-1116-Y |
0.348 |
|
2017 |
Liu H, Yao T, Li R, Ye Y. Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions. Mathematical Programming. 166: 207-240. PMID 29225375 DOI: 10.1007/S10107-017-1114-Y |
0.436 |
|
2016 |
Wang Z, Ye Y. Hidden-City ticketing: The cause and impact Transportation Science. 50: 288-305. DOI: 10.1287/Trsc.2015.0587 |
0.313 |
|
2016 |
Gao M, Yiu KC, Nordholm S, Ye Y. On a New SDP-SOCP Method for Acoustic Source Localization Problem Acm Transactions On Sensor Networks. 12: 36. DOI: 10.1145/2968449 |
0.417 |
|
2016 |
Hu RL, Skorupski R, Entriken R, Ye Y. A Mathematical Programming Formulation for Optimal Load Shifting of Electricity Demand for the Smart Grid Ieee Transactions On Big Data. 1-1. DOI: 10.1109/Tbdata.2016.2639528 |
0.338 |
|
2016 |
Chen C, He B, Ye Y, Yuan X. The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent Mathematical Programming. 155: 57-79. DOI: 10.1007/S10107-014-0826-5 |
0.444 |
|
2015 |
Qian S, Ye Y, Jiang B, Wang J. Constrained Multiobjective Optimization Algorithm Based on Immune System Model. Ieee Transactions On Cybernetics. PMID 26285230 DOI: 10.1109/TCYB.2015.2461651 |
0.321 |
|
2015 |
Zarepisheh M, Ye Y, Xing L. SU-F-BRB-11: An Integrated Alternating Direction Method of Multipliers for Treatment Planning Optimization. Medical Physics. 42: 3532. PMID 26128506 DOI: 10.1118/1.4925206 |
0.415 |
|
2015 |
Zarepisheh M, Li R, Ye Y, Xing L. Simultaneous beam sampling and aperture shape optimization for SPORT. Medical Physics. 42: 1012-22. PMID 25652514 DOI: 10.1118/1.4906253 |
0.352 |
|
2015 |
Post I, Ye Y. The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes Mathematics of Operations Research. 40: 859-868. DOI: 10.1287/Moor.2014.0699 |
0.309 |
|
2015 |
Dang C, Ye Y. A fixed point iterative approach to integer programming and its distributed computation Fixed Point Theory and Applications. 2015. DOI: 10.1186/S13663-015-0429-8 |
0.462 |
|
2015 |
Luo Z, Qi L, Ye Y. Linear operators and positive semidefiniteness of symmetric tensor spaces Science China-Mathematics. 58: 197-212. DOI: 10.1007/S11425-014-4930-Z |
0.307 |
|
2015 |
Wang Z, Glynn PW, Ye Y. Likelihood robust optimization for data-driven problems Computational Management Science. DOI: 10.1007/S10287-015-0240-3 |
0.418 |
|
2015 |
Skajaa A, Ye Y. A homogeneous interior-point algorithm for nonsymmetric convex conic optimization Mathematical Programming. 150: 391-422. DOI: 10.1007/S10107-014-0773-1 |
0.546 |
|
2014 |
Zarepisheh M, Ye Y, Boyd S, Li R, Xing L. SU-E-T-295: Simultaneous Beam Sampling and Aperture Shape Optimization for Station Parameter Optimized Radiation Therapy (SPORT). Medical Physics. 41: 292. PMID 28037470 DOI: 10.1118/1.4888627 |
0.338 |
|
2014 |
Delage E, Arroyo S, Ye Y. The Value of Stochastic Modeling in Two-Stage Stochastic Programs with Cost Uncertainty Operations Research. 62: 1377-1393. DOI: 10.1287/Opre.2014.1318 |
0.774 |
|
2014 |
Agrawal S, Wang Z, Ye Y. A Dynamic Near-Optimal Algorithm for Online Linear Programming Operations Research. 62: 876-890. DOI: 10.1287/Opre.2014.1289 |
0.501 |
|
2014 |
Wang Z, Deng S, Ye Y. Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems Operations Research. 62: 318-331. DOI: 10.1287/Opre.2013.1245 |
0.41 |
|
2014 |
Chen J, Feng L, Peng J, Ye Y. Analytical Results and Efficient Algorithm for Optimal Portfolio Deleveraging with Market Impact Operations Research. 62: 195-206. DOI: 10.1287/Opre.2013.1222 |
0.522 |
|
2014 |
Nguyen A, Ben-Chen M, Welnicka K, Ye Y, Guibas L. An optimization approach to improving collections of shape maps Computer Graphics Forum. 30: 1481-1491. DOI: 10.1111/J.1467-8659.2011.02022.X |
0.305 |
|
2014 |
Wen T, Thiele MR, Ciaurri DE, Aziz K, Ye Y. Waterflood management using two-stage optimization with streamline simulation Computational Geosciences. 18: 483-504. DOI: 10.1007/S10596-014-9404-4 |
0.353 |
|
2014 |
Behling R, Fischer A, Herrich M, Iusem A, Ye Y. A Levenberg-Marquardt method with approximate projections Computational Optimization and Applications. 59: 5-26. DOI: 10.1007/S10589-013-9573-4 |
0.34 |
|
2014 |
Bian W, Chen X, Ye Y. Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization Mathematical Programming. 149: 301-327. DOI: 10.1007/S10107-014-0753-5 |
0.457 |
|
2014 |
Chen X, Ge D, Wang Z, Ye Y. Complexity of unconstrained L2-Lp minimization Mathematical Programming. 143: 371-383. DOI: 10.1007/S10107-012-0613-0 |
0.594 |
|
2013 |
Zhu Z, Zhang J, Ye Y. Newsvendor optimization with limited distribution information Optimization Methods & Software. 28: 640-667. DOI: 10.1080/10556788.2013.768994 |
0.506 |
|
2013 |
Skajaa A, Andersen ED, Ye Y. Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems Mathematical Programming Computation. 5: 1-25. DOI: 10.1007/S12532-012-0046-Z |
0.496 |
|
2013 |
Qi L, Ye Y. Space tensor conic programming Computational Optimization and Applications. 59: 307-319. DOI: 10.1007/S10589-013-9577-0 |
0.35 |
|
2012 |
Fleming RM, Maes CM, Saunders MA, Ye Y, Palsson BØ. A variational principle for computing nonequilibrium fluxes and potentials in genome-scale biochemical networks. Journal of Theoretical Biology. 292: 71-7. PMID 21983269 DOI: 10.1016/J.Jtbi.2011.09.029 |
0.401 |
|
2012 |
Agrawal S, Ding Y, Saberi A, Ye Y. Price of Correlations in Stochastic Optimization Operations Research. 60: 150-162. DOI: 10.1287/Opre.1110.1011 |
0.469 |
|
2012 |
Zhang X, Qi L, Ye Y. The cubic spherical optimization problems Mathematics of Computation. 81: 1513-1525. DOI: 10.1090/S0025-5718-2012-02577-4 |
0.424 |
|
2012 |
Zhu Z, Dang C, Ye Y. A FPTAS for computing a symmetric Leontief competitive economy equilibrium Mathematical Programming. 131: 113-129. DOI: 10.1007/S10107-010-0348-8 |
0.489 |
|
2011 |
Agrawal S, Delage E, Peters M, Wang Z, Ye Y. A Unified Framework for Dynamic Prediction Market Design Operations Research. 59: 550-568. DOI: 10.1287/Opre.1110.0922 |
0.725 |
|
2011 |
Ye Y. The simplex and policy-iteration methods are strongly polynomial for the markov decision problem with a fixed discount rate Mathematics of Operations Research. 36: 593-603. DOI: 10.1287/Moor.1110.0516 |
0.468 |
|
2011 |
Ge D, He S, Ye Y, Zhang J. Geometric rounding: A dependent randomized rounding scheme Journal of Combinatorial Optimization. 22: 699-725. DOI: 10.1007/S10878-010-9320-Z |
0.671 |
|
2011 |
Dang C, Ye Y, Zhu Z. An interior-point path-following algorithm for computing a Leontief economy equilibrium Computational Optimization and Applications. 50: 223-236. DOI: 10.1007/S10589-010-9332-8 |
0.418 |
|
2011 |
Ge D, Jiang X, Ye Y. A note on the complexity of Lp minimization Mathematical Programming. 129: 285-299. DOI: 10.1007/S10107-011-0470-2 |
0.65 |
|
2011 |
Jiang X, Lim L, Yao Y, Ye Y. Statistical ranking and combinatorial Hodge theory Mathematical Programming. 127: 203-244. DOI: 10.1007/S10107-010-0419-X |
0.323 |
|
2010 |
Jin R, Min Z, Song E, Liu H, Ye Y. A novel fluence map optimization model incorporating leaf sequencing constraints. Physics in Medicine and Biology. 55: 1243-64. PMID 20124655 DOI: 10.1088/0031-9155/55/4/023 |
0.338 |
|
2010 |
Chen L, Ye Y, Zhang J. On Equilibrium Pricing As Convex Optimization Journal of Computational Mathematics. 28: 569-578. DOI: 10.4208/Jcm.2009.10-M1014 |
0.517 |
|
2010 |
Delage E, Ye Y. Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems Operations Research. 58: 595-612. DOI: 10.1287/Opre.1090.0741 |
0.777 |
|
2010 |
Carlsson JG, Armbruster B, Ye Y. Finding equitable convex partitions of points in a polygon efficiently Acm Transactions On Algorithms. 6. DOI: 10.1145/1824777.1824792 |
0.775 |
|
2010 |
Zhu Z, So AM, Ye Y. Universal Rigidity and Edge Sparsification for Sensor Network Localization Siam Journal On Optimization. 20: 3059-3081. DOI: 10.1137/090772009 |
0.746 |
|
2010 |
Chen X, Xu F, Ye Y. Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization Siam Journal On Scientific Computing. 32: 2832-2852. DOI: 10.1137/090761471 |
0.422 |
|
2010 |
Ling C, Nie J, Qi L, Ye Y. Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations Siam Journal On Optimization. 20: 1286-1310. DOI: 10.1137/080729104 |
0.426 |
|
2010 |
Xie Y, Armbruster B, Ye Y. Dynamic spectrum management with the competitive market model Ieee Transactions On Signal Processing. 58: 2442-2446. DOI: 10.1109/Tsp.2009.2039820 |
0.326 |
|
2010 |
Luo ZQ, Ma WK, So A, Ye Y, Zhang S. Semidefinite relaxation of quadratic optimization problems Ieee Signal Processing Magazine. 27: 20-34. DOI: 10.1109/Msp.2010.936019 |
0.743 |
|
2009 |
Lee L, Ma Y, Ye Y, Xing L. Conceptual formulation on four-dimensional inverse planning for intensity modulated radiation therapy. Physics in Medicine and Biology. 54: N255-66. PMID 19521008 DOI: 10.1088/0031-9155/54/13/N01 |
0.379 |
|
2009 |
So AM, Zhang J, Ye Y. Stochastic Combinatorial Optimization with Controllable Risk Aversion Level Mathematics of Operations Research. 34: 522-537. DOI: 10.1287/Moor.1090.0390 |
0.773 |
|
2009 |
Zhu L, Lee L, Ma Y, Ye Y, Mazzeo R, Xing L. MO-D-BRB-02: Using Total-Variation Regularization for IMRT Inverse Planning with Field-Specific Numbers of Segments Medical Physics. 36: 2692-2692. DOI: 10.1118/1.3182212 |
0.378 |
|
2009 |
Han Q, Punnen AP, Ye Y. An edge-reduction algorithm for the vertex cover problem Operations Research Letters. 37: 181-186. DOI: 10.1016/J.Orl.2009.01.010 |
0.423 |
|
2008 |
Zhu L, Lee L, Ma Y, Ye Y, Mazzeo R, Xing L. Using total-variation regularization for intensity modulated radiation therapy inverse planning with field-specific numbers of segments. Physics in Medicine and Biology. 53: 6653-72. PMID 18997262 DOI: 10.1088/0031-9155/53/23/002 |
0.369 |
|
2008 |
So AM, Ye Y, Zhang J. A Unified Theorem on SDP Rank Reduction Mathematics of Operations Research. 33: 910-920. DOI: 10.1287/Moor.1080.0326 |
0.725 |
|
2008 |
Benson SJ, Ye Y. Algorithm 875: DSDP5—software for semidefinite programming Acm Transactions On Mathematical Software. 34: 16. DOI: 10.1145/1356052.1356057 |
0.466 |
|
2008 |
Wang Z, Zheng S, Ye Y, Boyd S. Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization Siam Journal On Optimization. 19: 655-673. DOI: 10.1137/060669395 |
0.382 |
|
2008 |
Biswas P, Toh K, Ye Y. A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation Siam Journal On Scientific Computing. 30: 1251-1277. DOI: 10.1137/05062754X |
0.588 |
|
2008 |
Codenotti B, Saberi A, Varadarajan K, Ye Y. The complexity of equilibria: Hardness results for economies via a correspondence with games Theoretical Computer Science. 408: 188-198. DOI: 10.1016/J.Tcs.2008.08.007 |
0.363 |
|
2008 |
Zhu L, Ma Y, Lee L, Ye Y, Mazzeo R, Xing L. Fast Aperture-based Inverse Treatment Planning using Mixed Integer and Quadratic Optimization International Journal of Radiation Oncology*Biology*Physics. 72: S675. DOI: 10.1016/J.Ijrobp.2008.06.384 |
0.321 |
|
2008 |
Ye Y. A path to the Arrow-Debreu competitive market equilibrium Mathematical Programming. 111: 315-348. DOI: 10.1007/S10107-006-0065-5 |
0.51 |
|
2007 |
Varadarajan K, Venkatesh S, Ye Y, Zhang J. Approximating the Radii of Point Sets Siam Journal On Computing. 36: 1764-1776. DOI: 10.1137/050627472 |
0.509 |
|
2006 |
Biswas P, Lian T, Wang T, Ye Y. Semidefinite programming based algorithms for sensor network localization Acm Transactions On Sensor Networks. 2: 188-220. DOI: 10.1145/1149283.1149286 |
0.635 |
|
2006 |
Mahdian M, Ye Y, Zhang J. Approximation Algorithms for Metric Facility Location Problems Siam Journal On Computing. 36: 411-432. DOI: 10.1137/S0097539703435716 |
0.608 |
|
2006 |
Carter MW, Jin HH, Saunders MA, Ye Y. Spaseloc: An adaptive subproblem algorithm for scalable wireless sensor network localization Siam Journal On Optimization. 17: 1102-1128. DOI: 10.1137/040621600 |
0.441 |
|
2006 |
Biswas P, Liang T, Toh K, Ye Y, Wang T. Semidefinite Programming Approaches for Sensor Network Localization With Noisy Distance Measurements Ieee Transactions On Automation Science and Engineering. 3: 360-371. DOI: 10.1109/Tase.2006.877401 |
0.553 |
|
2006 |
Chen B, Ye Y, Zhang J. Lot-sizing scheduling with batch setup times Journal of Scheduling. 9: 299-310. DOI: 10.1007/S10951-006-8265-7 |
0.471 |
|
2006 |
Ye Y. Improved complexity results on solving real-number linear feasibility problems Mathematical Programming. 106: 339-363. DOI: 10.1007/S10107-005-0610-7 |
0.413 |
|
2005 |
Ye Y. A new complexity result on solving the Markov decision problem Mathematics of Operations Research. 30: 733-749. DOI: 10.1287/Moor.1050.0149 |
0.462 |
|
2005 |
Zhang J, Chen B, Ye Y. A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem Mathematics of Operations Research. 30: 389-403. DOI: 10.1287/Moor.1040.0125 |
0.58 |
|
2005 |
Ageev A, Ye Y, Zhang J. Improved Combinatorial Approximation Algorithms for the k -Level Facility Location Problem Siam Journal On Discrete Mathematics. 18: 207-217. DOI: 10.1137/S0895480102417215 |
0.506 |
|
2005 |
Rojas JM, Ye Y. On solving univariate sparse polynomials in logarithmic time Journal of Complexity. 21: 87-110. DOI: 10.1016/J.Jco.2004.03.004 |
0.384 |
|
2004 |
Zhang J, Ye Y, Han Q. Improved approximations for max set splitting and max NAE SAT Discrete Applied Mathematics. 142: 133-149. DOI: 10.1016/J.Dam.2002.07.001 |
0.582 |
|
2003 |
Ye Y, Zhang S. New Results on Quadratic Minimization Siam Journal On Optimization. 14: 245-267. DOI: 10.1137/S105262340139001X |
0.487 |
|
2003 |
Xu D, Ye Y, Zhang J. Approximating the 2-catalog segmentation problem using semidefinite programming relaxations Optimization Methods & Software. 18: 705-719. DOI: 10.1080/10556780310001634082 |
0.551 |
|
2003 |
Ye Y, Zhang J. Approximation of Dense- n /2-Subgraph and the Complement of Min-Bisection Journal of Global Optimization. 25: 55-73. DOI: 10.1023/A:1021390231133 |
0.538 |
|
2003 |
Yang H, Ye Y, Zhang J. An approximation algorithm for scheduling two parallel machines with capacity constraints Discrete Applied Mathematics. 130: 449-467. DOI: 10.1016/S0166-218X(02)00601-7 |
0.565 |
|
2002 |
Bai E, Cho H, Tempo R, Ye Y. Optimization with few violated constraints for linear bounded error parameter estimation Ieee Transactions On Automatic Control. 47: 1067-1077. DOI: 10.1109/Tac.2002.800644 |
0.427 |
|
2002 |
Han Q, Ye Y, Zhang H, Zhang J. On approximation of max-vertex-cover European Journal of Operational Research. 143: 342-355. DOI: 10.1016/S0377-2217(02)00330-2 |
0.536 |
|
2002 |
Zhang J, Ye Y. A note on the maximization version of the multi-level facility location problem Operations Research Letters. 30: 333-335. DOI: 10.1016/S0167-6377(02)00183-9 |
0.504 |
|
2002 |
Han Q, Ye Y, Zhang J. An improved rounding method and semidefinite programming relaxation for graph partition Mathematical Programming. 92: 509-535. DOI: 10.1007/S101070100288 |
0.565 |
|
2002 |
Tseng P, Ye Y. On some interior-point algorithms for nonconvex quadratic optimization Mathematical Programming, Series B. 93: 217-225. DOI: 10.1007/S10107-002-0310-5 |
0.449 |
|
2002 |
Mahdian M, Ye Y, Zhang J. Improved Approximation Algorithms for Metric Facility Location Problems Lecture Notes in Computer Science. 229-242. DOI: 10.1007/3-540-45753-4_20 |
0.586 |
|
2001 |
Todd MJ, Tunçel L, Ye Y. Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems Mathematical Programming. 90: 59-69. DOI: 10.1007/Pl00011420 |
0.489 |
|
2001 |
Ye Y. A .699-approximation algorithm for Max-Bisection Mathematical Programming. 90: 101-111. DOI: 10.1007/Pl00011415 |
0.399 |
|
1999 |
Anstreicher KM, Ji J, Potra FA, Ye Y. Probabilistic Analysis of An Infeasible-Interior-Point Algorithm for Linear Programming Mathematics of Operations Research. 24: 176-192. DOI: 10.1287/Moor.24.1.176 |
0.511 |
|
1999 |
Benson SJ, Ye Y, Zhang X. Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization Siam Journal On Optimization. 10: 443-461. DOI: 10.1137/S1052623497328008 |
0.505 |
|
1999 |
Xue G, Ye Y. An Efficient Algorithm for Minimizing a Sum of p -Norms Siam Journal On Optimization. 10: 551-579. DOI: 10.1137/S1052623497327088 |
0.457 |
|
1999 |
Chen X, Ye Y. On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities Siam Journal On Control and Optimization. 37: 589-616. DOI: 10.1137/S0363012997315907 |
0.428 |
|
1999 |
Bai E-, Ye Y, Tempo R. Bounded error parameter estimation: a sequential analytic center approach Ieee Transactions On Automatic Control. 44: 1107-1117. DOI: 10.1109/9.769366 |
0.383 |
|
1999 |
Bai EW, Ye Y. Constrained logarithmic least squares in parameter estimation Ieee Transactions On Automatic Control. 44: 182-186. DOI: 10.1109/9.739123 |
0.344 |
|
1999 |
Ye Y. Approximating Global Quadratic Optimization with Convex Quadratic Constraints Journal of Global Optimization. 15: 1-17. DOI: 10.1023/A:1008370723217 |
0.483 |
|
1999 |
Ye Y. Approximating quadratic programming with bound and quadratic constraints Mathematical Programming. 84: 219-226. DOI: 10.1007/S10107980012A |
0.47 |
|
1999 |
Nesterov YE, Todd MJ, Ye Y. Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems Mathematical Programming. 84: 227-267. DOI: 10.1007/S10107980009A |
0.408 |
|
1999 |
Andersen ED, Ye Y. On a homogeneous algorithm for the monotone complementarity problem Mathematical Programming. 84: 375-399. DOI: 10.1007/S101070050027 |
0.511 |
|
1999 |
Bai E, Tempo R, Ye Y. Recent results on the analytic center approach for bounded error parameter estimation Lecture Notes in Control and Information Sciences. 245-253. DOI: 10.1007/Bfb0109732 |
0.395 |
|
1998 |
Andersen ED, Ye Y. A Computational Study of the Homogeneous Algorithm for Large-scale Convex Optimization Computational Optimization and Applications. 10: 243-269. DOI: 10.1023/A:1018369223322 |
0.551 |
|
1998 |
Fu M, Luo Z, Ye Y. Journal of Combinatorial Optimization. 2: 29-50. DOI: 10.1023/A:1009739827008 |
0.45 |
|
1998 |
Todd MJ, Ye Y. Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming Mathematical Programming. 81: 1-21. DOI: 10.1007/Bf01584841 |
0.532 |
|
1998 |
Ye Y. On the complexity of approximating a KKT point of quadratic programming Mathematical Programming. 80: 195-211. DOI: 10.1007/Bf01581726 |
0.417 |
|
1997 |
Xue G, Ye Y. An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications Siam Journal On Optimization. 7: 1017-1036. DOI: 10.1137/S1052623495288362 |
0.541 |
|
1997 |
Ye Y. Complexity analysis of the analytic center cutting plane method that uses multiple cuts Mathematical Programming. 78: 85-104. DOI: 10.1007/Bf02614507 |
0.455 |
|
1997 |
Ye Y. On homogeneous and self-dual algorithms for LCP Mathematical Programming. 76: 211-221. DOI: 10.1007/Bf02614384 |
0.454 |
|
1997 |
Kortanek KO, Xu X, Ye Y. An infeasible interior-point algorithm for solving primal and dual geometric programs Mathematical Programming. 76: 155-181. DOI: 10.1007/Bf02614382 |
0.483 |
|
1997 |
Jansen B, Roos C, Terlaky T, Ye Y. Improved complexity using higher-order correctors for primal-dual Dikin affine scaling Mathematical Programming. 76: 117-130. DOI: 10.1007/Bf02614380 |
0.431 |
|
1997 |
Luo Z, Wu S, Ye Y. Predictor-corrector method for nonlinear complementarity problem Acta Mathematicae Applicatae Sinica. 13: 321-328. DOI: 10.1007/Bf02025887 |
0.363 |
|
1997 |
Ye Y. Interior point algorithms: theory and analysis Journal of the Operational Research Society. 51: 769. DOI: 10.1002/9781118032701 |
0.449 |
|
1996 |
Andersen ED, Ye Y. Combining Interior-Point and Pivoting Algorithms for Linear Programming Management Science. 42: 1719-1731. DOI: 10.1287/Mnsc.42.12.1719 |
0.55 |
|
1996 |
Goffin J, Luo Z, Ye Y. Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems Siam Journal On Optimization. 6: 638-652. DOI: 10.1137/S1052623493258635 |
0.502 |
|
1996 |
Vavasis SA, Ye Y. A primal-dual interior point method whose running time depends only on the constraint matrix Mathematical Programming. 74: 79-120. DOI: 10.1007/Bf02592148 |
0.464 |
|
1996 |
Vavasis SA, Ye Y. Identifying an optimal basis in linear programming Annals of Operations Research. 62: 565-572. DOI: 10.1007/Bf02206830 |
0.42 |
|
1996 |
Todd MJ, Ye Y. A lower bound on the number of iterations of long-step primal-dual linear programming algorithms Annals of Operations Research. 62: 233-252. DOI: 10.1007/Bf02206818 |
0.444 |
|
1996 |
Xu X, Hung P, Ye Y. A simplified homogeneous and self-dual linear programming algorithm and its implementation Annals of Operations Research. 62: 151-171. DOI: 10.1007/Bf02206815 |
0.476 |
|
1996 |
Potra FA, Ye Y. Interior-point methods for nonlinear complementarity problems Journal of Optimization Theory and Applications. 88: 617-642. DOI: 10.1007/Bf02192201 |
0.472 |
|
1996 |
Ye Y. How partial knowledge helps to solve linear programs Journal of Complexity. 12: 480-491. DOI: 10.1006/Jcom.1996.0029 |
0.453 |
|
1995 |
Jones PC, Lowe TJ, Muller G, Xu N, Ye Y, Zydiak JL. Specially Structured Uncapacitated Facility Location Problems Operations Research. 43: 661-669. DOI: 10.1287/Opre.43.4.661 |
0.422 |
|
1995 |
Ye Y. On the von Neumann economic growth problem Mathematics of Operations Research. 20: 617-633. DOI: 10.1287/Moor.20.3.617 |
0.378 |
|
1995 |
Mizuno S, Todd MJ, Ye Y. A surface of analytic centers and primal-dual infeasible-interior-point algorithms for linear programming Mathematics of Operations Research. 20: 135-162. DOI: 10.1287/Moor.20.1.135 |
0.463 |
|
1995 |
Bosch RJ, Ye Y, Woodworth GG. A convergent algorithm for quantile regression with smoothing splines Computational Statistics and Data Analysis. 19: 613-630. DOI: 10.1016/0167-9473(94)00018-E |
0.493 |
|
1995 |
Vavasis SA, Ye Y. Condition numbers for polyhedra with real number data Operations Research Letters. 17: 209-214. DOI: 10.1016/0167-6377(95)00019-G |
0.332 |
|
1995 |
Xu X, Ye Y. A generalized homogeneous and self-dual algorithm for linear programming Operations Research Letters. 17: 181-190. DOI: 10.1016/0167-6377(95)00002-2 |
0.447 |
|
1995 |
Tapia RA, Zhang Y, Ye Y. On the convergence of the iteration sequence in primal-dual interior-point methods Mathematical Programming. 68: 141-154. DOI: 10.1007/Bf01585761 |
0.36 |
|
1994 |
Ye Y, Todd MJ, Mizuno S. An O(nL) -iteration homogeneous and self-dual linear programming algorithm Mathematics of Operations Research. 19: 53-67. DOI: 10.1287/Moor.19.1.53 |
0.533 |
|
1994 |
Ye Y. Toward probabilistic analysis of interior-point algorithms for linear programming Mathematics of Operations Research. 19: 38-52. DOI: 10.1287/Moor.19.1.38 |
0.483 |
|
1994 |
Ye Y. Combining Binary Search and Newton′s Method to Compute Real Roots for a Class of Real Functions Journal of Complexity. 10: 271-280. DOI: 10.1006/Jcom.1994.1014 |
0.362 |
|
1993 |
Mizuno S, Todd MJ, Ye Y. On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming Mathematics of Operations Research. 18: 964-981. DOI: 10.1287/Moor.18.4.964 |
0.448 |
|
1993 |
Ye Y. A fully polynomial-time approximation algorithm for computing a stationary point of the general linear complementarity problem Mathematics of Operations Research. 18: 334-345. DOI: 10.1287/Moor.18.2.334 |
0.484 |
|
1993 |
Kaliski JA, Ye Y. A Short-Cut Potential Reduction Algorithm for Linear Programming Management Science. 39: 757-776. DOI: 10.1287/Mnsc.39.6.757 |
0.495 |
|
1993 |
Potra FA, Ye Y. A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems Siam Journal On Optimization. 3: 843-860. DOI: 10.1137/0803043 |
0.525 |
|
1993 |
Pardalos PM, Ye Y, Han C, Kaliski JA. Solution of P 0 -matrix linear complementarity problems using a potential reduction algorithm Siam Journal On Matrix Analysis and Applications. 14: 1048-1060. DOI: 10.1137/0614069 |
0.428 |
|
1993 |
Kaliski JA, Ye Y. An extension of the potential reduction algorithm for linear complementarity problems with some priority goals Linear Algebra and Its Applications. 193: 35-50. DOI: 10.1016/0024-3795(93)90270-X |
0.389 |
|
1993 |
Ye Y, Anstreicher K. On quadratic and O n L convergence of a predictor-corrector algorithm for LCP Mathematical Programming. 62: 537-551. DOI: 10.1007/Bf01585182 |
0.484 |
|
1993 |
Mehrotra S, Ye Y. Finding an interior point in the optimal face of linear programs Mathematical Programming. 62: 497-515. DOI: 10.1007/Bf01585180 |
0.449 |
|
1993 |
Ye Y, Kortanek KO, Kaliski J, Huang S. Near boundary behavior of primal-dual potential reduction algorithms for linear programming Mathematical Programming. 58: 243-255. DOI: 10.1007/Bf01581269 |
0.44 |
|
1993 |
Ye Y, Güler O, Tapia RA, Zhang Y. A quadratically convergent O( {Mathematical expression}L)-iteration algorithm for linear programming Mathematical Programming. 59: 151-162. DOI: 10.1007/Bf01581242 |
0.443 |
|
1993 |
Güler O, Ye Y. Convergence behavior of interior-point algorithms Mathematical Programming. 60: 215-228. DOI: 10.1007/Bf01580610 |
0.454 |
|
1992 |
Han CG, Pardalos PM, Ye Y. On the solution of indefinite quadratic problems using an interior-point algorithm Informatica (Netherlands). 3: 474-496. DOI: 10.3233/Inf-1992-3403 |
0.532 |
|
1992 |
Ye Y. A Potential Reduction Algorithm Allowing Column Generation Siam Journal On Optimization. 2: 7-20. DOI: 10.1137/0802002 |
0.449 |
|
1992 |
Han CG, Pardalos PM, Ye Y. Implementation of interior-point algorithms for some entropy optimization problems Optimization Methods and Software. 1: 71-80. DOI: 10.1080/10556780708805507 |
0.495 |
|
1992 |
Kojima M, Megiddo N, Ye Y. An interior point potential reduction algorithm for the linear complementarity problem Mathematical Programming. 54: 267-279. DOI: 10.1007/Bf01586054 |
0.416 |
|
1992 |
Ye Y. On the finite convergence of interior-point algorithms for linear programming Mathematical Programming. 57: 325-335. DOI: 10.1007/Bf01581087 |
0.476 |
|
1992 |
Ye Y. On affine scaling algorithms for nonconvex quadratic programming Mathematical Programming. 56: 285-300. DOI: 10.1007/Bf01580903 |
0.526 |
|
1991 |
Kaliski JA, Ye Y. Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program Operations Research Letters. 10: 389-393. DOI: 10.1016/0167-6377(91)90040-V |
0.465 |
|
1991 |
Kortanek KO, Potra F, Ye Y. On some efficient interior point methods for nonlinear convex programming Linear Algebra and Its Applications. 152: 169-189. DOI: 10.1016/0024-3795(91)90274-Z |
0.429 |
|
1991 |
Pardalos PM, Ye Y, Han CG. Algorithms for the solution of quadratic knapsack problems Linear Algebra and Its Applications. 152: 69-91. DOI: 10.1016/0024-3795(91)90267-Z |
0.536 |
|
1991 |
Ye Y, Pardalos PM. A class of linear complementarity problems solvable in polynomial time Linear Algebra and Its Applications. 152: 3-17. DOI: 10.1016/0024-3795(91)90264-W |
0.464 |
|
1991 |
Ye Y. An O(n3L) potential reduction algorithm for linear programming Mathematical Programming. 50: 239-258. DOI: 10.1007/Bf01594937 |
0.457 |
|
1991 |
Ye Y. Comparative analysis of affine scaling algorithms based on simplifying assumptions Mathematical Programming. 52: 405-414. DOI: 10.1007/Bf01582897 |
0.426 |
|
1990 |
Ye Y. Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming Mathematics of Operations Research. 15: 564-572. DOI: 10.1287/Moor.15.3.564 |
0.486 |
|
1990 |
Todd MJ, Ye Y. A centered projective algorithm for linear programming Mathematics of Operations Research. 15: 508-529. DOI: 10.1287/Moor.15.3.508 |
0.438 |
|
1990 |
Ye Y. A class of projective transformations for linear programming Siam Journal On Computing. 19: 457-466. DOI: 10.1137/0219030 |
0.399 |
|
1990 |
Pardalos PM, Ye Y, Han C. An interior-point algorithm for large-scale quadratic problems with box constraints Lecture Notes in Control and Information Sciences. 144: 413-422. DOI: 10.1007/Bfb0120064 |
0.498 |
|
1990 |
Ye Y. Interior-point algorithms for global optimization Annals of Operations Research. 25: 59-73. DOI: 10.1007/Bf02283687 |
0.487 |
|
1990 |
Ye Y. A "build-down" scheme for linear programming Mathematical Programming. 46: 61-72. DOI: 10.1007/Bf01585727 |
0.433 |
|
1990 |
Ye Y, Todd MJ. Containing and shrinking ellipsoids in the path-following algorithm Mathematical Programming. 47: 1-9. DOI: 10.1007/Bf01580848 |
0.462 |
|
1989 |
Ye Y, Tse E. An extension of Karmarkar projective algorithm for convex quadratic programming Mathematical Programming. 44: 157-179. DOI: 10.1007/Bf01587086 |
0.765 |
|
1989 |
Ye Y. Eliminating columns in the simplex method for linear programming Journal of Optimization Theory and Applications. 63: 69-77. DOI: 10.1007/Bf00940732 |
0.406 |
|
1987 |
Ye Y. Karmarkar's algorithm and the ellipsoid method Operations Research Letters. 6: 177-182. DOI: 10.1016/0167-6377(87)90016-2 |
0.46 |
|
1987 |
Ye Y, Kojima M. Recovering optimal dual solutions on Karmarkar's polynomial algorithm for linear programming Mathematical Programming. 39: 305-317. DOI: 10.1007/Bf02592079 |
0.501 |
|
Show low-probability matches. |