Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYing Cui 0004
Person information
- affiliation: University of Southern California, Department of Industrial and Systems Engineering, Los Angeles, CA, USA
- affiliation (PhD 2016): National University of Singapore, Department of Mathematics, Singapore
Other persons with the same name
- Ying Cui — disambiguation page
- Ying Cui 0001
![[0000-0003-3181-9775]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-3181-9775")
— Shanghai Jiao Tong University, Department of Electronic Engineering, China (and 5 more) - Ying Cui 0002 — Boston University, Center for Polymer Studies and Department of Physics, MA, USA (and 2 more)
- Ying Cui 0003 — Fudan University, School of Computer Science, Shanghai, China
- Ying Cui 0005 — Qingdao University of Science and Technology, College of Electromechanical Engineering, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Ziyu He, Shaoning Han, Andrés Gómez, Ying Cui, Jong-Shi Pang:
Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix. Math. Program. 204(1): 517-566 (2024)- [j16]Hanyang Li, Ying Cui:
A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions. SIAM J. Optim. 34(1): 306-335 (2024) - 2022
- [j15]Zhengling Qi, Ying Cui, Yufeng Liu, Jong-Shi Pang:
Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization. Math. Oper. Res. 47(3): 2034-2064 (2022) - [j14]Ying Cui, Ling Liang, Defeng Sun, Kim-Chuan Toh:
On Degenerate Doubly Nonnegative Projection Problems. Math. Oper. Res. 47(3): 2219-2239 (2022) - [j13]Junyi Liu, Ying Cui, Jong-Shi Pang:
Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization. Math. Oper. Res. 47(4): 3051-3083 (2022) - 2021
- [j12]Ying Cui, Ziyu He, Jong-Shi Pang:
Nonconvex robust programming via value-function optimization. Comput. Optim. Appl. 78(2): 411-450 (2021) - [j11]Shuai Wang, Tsung-Hui Chang, Ying Cui, Jong-Shi Pang:
Clustering by Orthogonal NMF Model and Non-Convex Penalty Optimization. IEEE Trans. Signal Process. 69: 5273-5288 (2021) - 2020
- [j10]Ying Cui, Tsung-Hui Chang, Mingyi Hong, Jong-Shi Pang:
A Study of Piecewise Linear-Quadratic Programs. J. Optim. Theory Appl. 186(2): 523-553 (2020) - [j9]Ying Cui, Ziyu He, Jong-Shi Pang:
MultiComposite Nonconvex Optimization for Training Deep Neural Networks. SIAM J. Optim. 30(2): 1693-1723 (2020) - [j8]Junyi Liu, Ying Cui, Jong-Shi Pang, Suvrajeet Sen:
Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse. SIAM J. Optim. 30(3): 2530-2558 (2020)
2010 – 2019
- 2019
- [j7]Ying Cui, Defeng Sun, Kim-Chuan Toh:
On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming. Math. Program. 178(1-2): 381-415 (2019) - [j6]Zhengling Qi, Ying Cui, Yufeng Liu, Jong-Shi Pang:
Estimation of Individualized Decision Rules Based on an Optimized Covariate-Dependent Equivalent of Random Outcomes. SIAM J. Optim. 29(3): 2337-2362 (2019) - [j5]Ying Cui, Defeng Sun, Kim-Chuan Toh:
Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone. SIAM J. Optim. 29(4): 2785-2813 (2019) - [c1]Shuai Wang, Tsung-Hui Chang, Ying Cui, Jong-Shi Pang:
Clustering by Orthogonal Non-negative Matrix Factorization: A Sequential Non-convex Penalty Approach. ICASSP 2019: 5576-5580 - [i3]Shuai Wang, Tsung-Hui Chang, Ying Cui, Jong-Shi Pang:
Clustering by Orthogonal NMF Model and Non-Convex Penalty Optimization. CoRR abs/1906.00570 (2019) - [i2]Zhengling Qi, Ying Cui, Yufeng Liu, Jong-Shi Pang:
Estimation of Individualized Decision Rules Based on an Optimized Covariate-Dependent Equivalent of Random Outcomes. CoRR abs/1908.10742 (2019) - [i1]Zhengling Qi, Ying Cui, Yufeng Liu, Jong-Shi Pang:
Statistical Analysis of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization. CoRR abs/1910.02488 (2019) - 2018
- [j4]Ying Cui, Jong-Shi Pang, Bodhisattva Sen:
Composite Difference-Max Programs for Modern Statistical Estimation Problems. SIAM J. Optim. 28(4): 3344-3374 (2018) - 2017
- [j3]Ying Cui, Chao Ding, Xinyuan Zhao:
Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions. SIAM J. Optim. 27(4): 2332-2355 (2017) - 2016
- [j2]Ying Cui, Chenlei Leng, Defeng Sun:
Sparse estimation of high-dimensional correlation matrices. Comput. Stat. Data Anal. 93: 390-403 (2016) - [j1]Ying Cui, Xudong Li, Defeng Sun, Kim-Chuan Toh:
On the Convergence Properties of a Majorized Alternating Direction Method of Multipliers for Linearly Constrained Convex Optimization Problems with Coupled Objective Functions. J. Optim. Theory Appl. 169(3): 1013-1041 (2016)
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 2024-05-09 00:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
