Zobrazeno 1 - 10
of 18
pro vyhledávání: '"SHUOGUANG YANG"'
Publikováno v:
SIAM Journal on Optimization. 29:616-659
Stochastic gradient methods are scalable for solving large-scale optimization problems that involve empirical expectations of loss functions. Existing results mainly apply to optimization problems ...
Publikováno v:
EC
Online retailing has seen steady growth over the last decade. According to the Digital Commerce (formerly Internet Retailer) analysis of the US Commerce Department's year-end retail data, online sales constituted 16% of all retail sales in 2019, and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::589521826c9a9bb760256b87ebf66b1a
http://arxiv.org/abs/2012.03800
http://arxiv.org/abs/2012.03800
Publikováno v:
IEEE Transactions on Pattern Analysis and Machine Intelligence. 40:1964-1978
While clustering has been well studied in the past decade, model selection has drawn much less attention due to the difficulty of the problem. In this paper, we address both problems in a joint manner by recovering an ideal affinity tensor from an im
Publikováno v:
CDC
We describe a robust multiperiod transmission planning model including renewables and batteries, where battery output is used to partly offset renewable output deviations from forecast. A central element is a nonconvex battery operation model plus a
Autor:
SHUOGUANG YANG1 sy2614@columbia.edu, MENGDI WANG2 mengdiw@princeton.edu, ETHAN X. FANG3 xxf13@psu.edu
Publikováno v:
SIAM Journal on Optimization. 2019, Vol. 29 Issue 1, p616-659. 44p.
Autor:
Daniel Bienstock, Sebastian Sager, Gonzalo Muñoz, Carsten Matke, Shuoguang Yang, David Kleinhans
Publikováno v:
Complex Networks & Their Applications V ISBN: 9783319509006
COMPLEX NETWORKS
COMPLEX NETWORKS
In this paper we investigate a robust optimization framework for controlling energy storage devices in power networks with high share of fluctuating renewable energy sources. Our approach relies on the industry-standard DC power flow approximation, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6f7bc558da5c84b40eab571e67916f8
https://doi.org/10.1007/978-3-319-50901-3_64
https://doi.org/10.1007/978-3-319-50901-3_64
Publikováno v:
CVPR
Estimating the number of clusters remains a difficult model selection problem. We consider this problem in the domain where the affinity relations involve groups of more than two nodes. Building on the previous formulation for the pairwise affinity c
Publikováno v:
EC: Economics & Computation; 2021, p316-317, 2p
Autor:
Matke, Carsten, Bienstock, Daniel, Muñoz, Gonzalo, Yang, Shuoguang, Kleinhans, David, Sager, Sebastian
Publikováno v:
Complex Networks & Their Applications V; 2017, p809-820, 12p
Publikováno v:
IEEE Transactions on Pattern Analysis & Machine Intelligence; Aug2018, Vol. 40 Issue 8, p1964-1978, 15p