


Остановите войну!
for scientists:


default search action
Yinyu Ye
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. The links to all actual bibliographies of persons of the same or a similar name can be found below. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information

Other persons with the same name
- Yinyu Ye 0001 — Stanford University, USA (and 1 more)
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i5]Long Chen, Kai-Uwe Bletzinger, Nicolas R. Gauger, Yinyu Ye:
A gradient descent akin method for constrained optimization: algorithms and applications. CoRR abs/2302.11898 (2023) - 2022
- [j15]Hongcheng Liu
, Yinyu Ye, Hung Yi Lee:
High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks. Oper. Res. 70(6): 3176-3197 (2022) - [c3]Chaoyu Chen, Xin Yang, Ruobing Huang, Xindi Hu, Yankai Huang, Xiduo Lu, Xinrui Zhou, Mingyuan Luo, Yinyu Ye, Xue Shuang, Juzheng Miao, Yi Xiong, Dong Ni:
Fine-Grained Correlation Loss for Regression. MICCAI (8) 2022: 663-672 - [i4]Chaoyu Chen, Xin Yang, Ruobing Huang, Xindi Hu, Yankai Huang, Xiduo Lu, Xinrui Zhou, Mingyuan Luo, Yinyu Ye, Xue Shuang, Juzheng Miao, Yi Xiong, Dong Ni:
Fine-grained Correlation Loss for Regression. CoRR abs/2207.00347 (2022) - 2021
- [i3]Guanting Chen, Johann Demetrio Gaebler, Matt Peng, Chunlin Sun, Yinyu Ye:
An Adaptive State Aggregation Algorithm for Markov Decision Processes. CoRR abs/2107.11053 (2021) - 2020
- [i2]Masoud Badiei Khuzani, Yinyu Ye, Sandy Napel, Lei Xing:
A Mean-Field Theory for Learning the Schönberg Measure of Radial Basis Functions. CoRR abs/2006.13330 (2020)
2010 – 2019
- 2015
- [j14]Jing-bo Zhuang, Zhen-miao Deng, Yinyu Ye, Yixiong Zhang, Yan-yong Chen:
Micro-Doppler Ambiguity Resolution Based on Short-Time Compressed Sensing. J. Electr. Comput. Eng. 2015: 864508:1-864508:7 (2015) - [j13]Ian Post, Yinyu Ye:
The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes. Math. Oper. Res. 40(4): 859-868 (2015) - 2013
- [c2]Ian Post, Yinyu Ye:
The simplex method is strongly polynomial for deterministic Markov decision processes. SODA 2013: 1465-1473 - 2012
- [i1]Ian Post, Yinyu Ye:
The simplex method is strongly polynomial for deterministic Markov decision processes. CoRR abs/1208.5083 (2012)
2000 – 2009
- 2008
- [e1]Ying Zhang, Yinyu Ye:
Proceedings of the ACM International Workshop on Mobile Entity Localization and Tracking in GPS-less Environments, MELT 2008, San Francisco, California, USA, September 19, 2008. ACM 2008, ISBN 978-1-60558-189-7 [contents] - 2006
- [j12]Michael W. Carter
, Holly H. Jin, Michael A. Saunders
, Yinyu Ye:
SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization. SIAM J. Optim. 17(4): 1102-1128 (2006) - 2005
- [c1]Kamal Jain, Vijay V. Vazirani, Yinyu Ye:
Market equilibria for homothetic, quasi-concave utilities and economies of scale in production. SODA 2005: 63-71
1990 – 1999
- 1999
- [j11]Fang Wu, Shiquan Wu, Yinyu Ye:
On quadratic convergence of the O(√nK)-iteration homogeneous and self‐duallinear programming algorithm. Ann. Oper. Res. 87: 393-406 (1999) - 1998
- [b1]Yinyu Ye:
Interior point algorithms - theory and analysis. Wiley-Interscience series in discrete mathematics and optimization, Wiley 1998, ISBN 978-0-471-17420-2, pp. I-XV, 1-418 - 1996
- [j10]Pi-Fang Hung, Yinyu Ye:
An Asymptotical O(√(n) L)-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods. SIAM J. Optim. 6(3): 570-586 (1996) - 1995
- [j9]Philip C. Jones, Timothy J. Lowe, Georg Muller, Ning Xu, Yinyu Ye, James L. Zydiak:
Specially Structured Uncapacitated Facility Location Problems. Oper. Res. 43(4): 661-669 (1995) - [j8]Shinji Mizuno, Michael J. Todd, Yinyu Ye:
A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming. Math. Oper. Res. 20(1): 135-162 (1995) - 1994
- [j7]Jun Ji, Yinyu Ye:
A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar's Potential Function. SIAM J. Optim. 4(3): 512-520 (1994) - [j6]Yinyu Ye:
Interior-Point Polynomial Algorithms in Convex Programming (Y. Nesterov and A. Nemirovskii). SIAM Rev. 36(4): 682-683 (1994) - 1993
- [j5]Yinyu Ye, Kenneth O. Kortanek, John A. Kaliski, S. Huang:
Near boundary behavior of primal-dual potential reduction algorithms for linear programming. Math. Program. 58: 243-255 (1993) - [j4]Florian A. Potra, Yinyu Ye:
A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems. SIAM J. Optim. 3(4): 843-860 (1993) - [j3]Panos M. Pardalos, Yinyu Ye, Chi-Geun Han, John A. Kaliski:
Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm. SIAM J. Matrix Anal. Appl. 14(4): 1048-1060 (1993) - 1992
- [j2]Yinyu Ye:
A Potential Reduction Algorithm Allowing Column Generation. SIAM J. Optim. 2(1): 7-20 (1992) - 1990
- [j1]Yinyu Ye, Michael J. Todd:
Containing and Shrinking Ellipsoids in the Path-Following Algorithm. Math. Program. 47: 1-9 (1990)
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-15 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint