Obserwuj
Harsha Nagarajan
Harsha Nagarajan
Scientist, Theoretical Division (Applied Mathematics), Los Alamos National Laboratory
Zweryfikowany adres z lanl.gov - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Security-constrained design of isolated multi-energy microgrids
S Mashayekh, M Stadler, G Cardoso, M Heleno, SC Madathil, ...
IEEE Transactions on Power Systems 33 (3), 2452-2462, 2017
1302017
An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
H Nagarajan, M Lu, S Wang, R Bent, K Sundar
Journal of Global Optimization 74, 639-675, 2019
902019
Tightening McCormick relaxations for nonlinear programs via dynamic multivariate partitioning
H Nagarajan, M Lu, E Yamangil, R Bent
Principles and Practice of Constraint Programming: 22nd International …, 2016
902016
Juniper: An open-source nonlinear branch-and-bound solver in Julia
O Kröger, C Coffrin, H Hijazi, H Nagarajan
Integration of Constraint Programming, Artificial Intelligence, and …, 2018
852018
Resilient design of large-scale distribution feeders with networked microgrids
A Barnes, H Nagarajan, E Yamangil, R Bent, S Backhaus
Electric Power Systems Research 171, 150-157, 2019
802019
Optimal resilient transmission grid design
H Nagarajan, E Yamangil, R Bent, P Van Hentenryck, S Backhaus
2016 Power Systems Computation Conference (PSCC), 1-7, 2016
782016
Chance-constrained unit commitment with N-1 security and wind uncertainty
K Sundar, H Nagarajan, L Roald, S Misra, R Bent, D Bienstock
IEEE Transactions on control of network systems 6 (3), 1062-1074, 2019
662019
Resilient off-grid microgrids: Capacity planning and N-1 security
SC Madathil, E Yamangil, H Nagarajan, A Barnes, R Bent, S Backhaus, ...
IEEE Transactions on Smart Grid 9 (6), 6511-6521, 2017
602017
Optimal transmission line switching under geomagnetic disturbances
M Lu, H Nagarajan, E Yamangil, R Bent, S Backhaus, A Barnes
IEEE Transactions on Power Systems 33 (3), 2539-2550, 2017
552017
Tight piecewise convex relaxations for global optimization of optimal power flow
M Lu, H Nagarajan, R Bent, SD Eksioglu, SJ Mason
2018 Power Systems Computation Conference (PSCC), 1-7, 2018
492018
Probabilistic Nk failure‐identification for power systems
K Sundar, C Coffrin, H Nagarajan, R Bent
Networks 71 (3), 302-321, 2018
382018
Communication-constrained expansion planning for resilient distribution systems
G Byeon, P Van Hentenryck, R Bent, H Nagarajan
INFORMS Journal on Computing 32 (4), 968-985, 2020
372020
Enforcing the non‐negativity constraint and maximum principles for diffusion with decay on general computational grids
H Nagarajan, KB Nakshatrala
International Journal for Numerical Methods in Fluids 67 (7), 820-847, 2011
352011
Generalized convex hull pricing for the AC optimal power flow problem
M Garcia, H Nagarajan, R Baldick
IEEE Transactions on Control of Network Systems 7 (3), 1500-1510, 2020
332020
Adaptive convex relaxations for gas pipeline network optimization
F Wu, H Nagarajan, A Zlotnik, R Sioshansi, AM Rudkevich
2017 American Control Conference (ACC), 4710-4716, 2017
322017
Optimization-based bound tightening using a strengthened QC-relaxation of the optimal power flow problem
K Sundar, H Nagarajan, S Misra, M Lu, C Coffrin, R Bent
2023 62nd IEEE conference on decision and control (CDC), 4598-4605, 2023
312023
Proving global optimality of ACOPF solutions
S Gopinath, HL Hijazi, T Weisser, H Nagarajan, M Yetkin, K Sundar, ...
Electric Power Systems Research 189, 106688, 2020
312020
Unit commitment with n-1 security and wind uncertainty
K Sundar, H Nagarajan, M Lubin, L Roald, S Misra, R Bent, D Bienstock
2016 Power Systems Computation Conference (PSCC), 1-7, 2016
312016
Evaluating ising processing units with integer programming
C Coffrin, H Nagarajan, R Bent
Integration of Constraint Programming, Artificial Intelligence, and …, 2019
302019
A numerical methodology for enforcing maximum principles and the non-negative constraint for transient diffusion equations
KB Nakshatrala, H Nagarajan, M Shabouei
Communications in Computational Physics 19 (1), 53-93, 2016
232016
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20