Zobrazeno 1 - 10
of 227
pro vyhledávání: '"Sen, Suvrajeet"'
Autor:
Zhang, Di, Sen, Suvrajeet
Stochastic First-Order (SFO) methods have been a cornerstone in addressing a broad spectrum of modern machine learning (ML) challenges. However, their efficacy is increasingly questioned, especially in large-scale applications where empirical evidenc
Externí odkaz:
http://arxiv.org/abs/2407.21091
Autor:
Zhang, Di, Sen, Suvrajeet
The progressive hedging algorithm (PHA) is a cornerstone among algorithms for large-scale stochastic programming problems. However, its traditional implementation is hindered by some limitations, including the requirement to solve all scenario subpro
Externí odkaz:
http://arxiv.org/abs/2407.20944
Autor:
Diao, Shuotao, Sen, Suvrajeet
Stochastic programming models can lead to very large-scale optimization problems for which it may be impossible to enumerate all possible scenarios. In such cases, one adopts a sampling-based solution methodology in which case the reliability of the
Externí odkaz:
http://arxiv.org/abs/2405.10414
Driven by ambitious renewable portfolio standards, large-scale inclusion of variable energy resources (such as wind and solar) are expected to introduce unprecedented levels of uncertainty into power system operations. The current practice of operati
Externí odkaz:
http://arxiv.org/abs/2107.14558
Autor:
Gangammanavar, Harsha, Sen, Suvrajeet
Multistage stochastic programming deals with operational and planning problems that involve a sequence of decisions over time while responding to realizations that are uncertain. Algorithms designed to address multistage stochastic linear programming
Externí odkaz:
http://arxiv.org/abs/2010.12129
Autor:
Diao, Shuotao1 (AUTHOR), Sen, Suvrajeet1 (AUTHOR) s.sen@usc.edu
Publikováno v:
Computational Optimization & Applications. Mar2024, Vol. 87 Issue 2, p355-395. 41p.
This work considers a stochastic Nash game in which each player solves a parameterized stochastic optimization problem. In deterministic regimes, best-response schemes have been shown to be convergent under a suitable spectral property associated wit
Externí odkaz:
http://arxiv.org/abs/1704.04578
Autor:
Sen, Suvrajeet
This dissertation deals with a class of nonconvex mathematical programs called Extreme Point Mathematical Programs (EPMP). These problems are generalizations of certain Integer Programming problems and also find their application in other nonconvex p
Externí odkaz:
http://hdl.handle.net/10919/80269
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.