Follow
Shuvomoy Das Gupta
Shuvomoy Das Gupta
Ph.D. Student, MIT Operations Research Center
Verified email at mit.edu - Homepage
Title
Cited by
Cited by
Year
A two-step linear programming model for energy-efficient timetables in metro railway networks
S Das Gupta, JK Tobin, L Pavel
Transportation Research Part B: Methodological 93, 57-74, 2016
842016
Branch-and-bound performance estimation programming: A unified methodology for constructing optimal optimization methods
S Das Gupta, BPG Van Parys, EK Ryu
Mathematical Programming Series A, 2023
202023
An optimization model to utilize regenerative braking energy in a railway network
S Das Gupta, L Pavel, JK Tobin
2015 American Control Conference (ACC), 5919-5924, 2015
132015
Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses
S Das Gupta, RM Freund, XA Sun, A Taylor
arXiv preprint arXiv:2301.01530, 2023
62023
Computer-Assisted Design of Accelerated Composite Optimization Methods: OptISTA
U Jang, S Das Gupta, EK Ryu
arXiv preprint arXiv:2305.15704, 2023
22023
On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
S Das Gupta, L Pavel
Journal of Global Optimization 74 (3), 523–548, 2019
22019
Multi-player minimum cost flow problems with nonconvex costs and integer flows
S Das Gupta, L Pavel
2016 IEEE 55th Conference on Decision and Control (CDC), 7617-7622, 2016
22016
Exterior-point optimization for sparse and low-rank optimization
S Das Gupta, B Stellato, BPG Van Parys
arXiv preprint arXiv:2011.04552, 2023
1*2023
On Convergence of Heuristics Based on Douglas-Rachford Splitting and ADMM to Minimize Convex Functions over Nonconvex Sets
S Das Gupta
Communication, Control, and Computing (Allerton), 2018 56th Annual Allerton …, 2018
12018
Energy-optimal Timetable Design for Sustainable Metro Railway Networks
S Das Gupta, BPG Van Parys, JK Tobin
arXiv preprint arXiv:2309.05489, 2023
2023
The system can't perform the operation now. Try again later.
Articles 1–10