Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Kaushik, Harshal"'
The transition to electric vehicles (EVs) marks a pivotal shift in personal mobility, driven by policy incentives and automotive innovations. However, the expansion of EVs for long-distance travel is hindered by charging time concerns, the sparse dis
Externí odkaz:
http://arxiv.org/abs/2404.14452
Optimal decision-making is key to efficient allocation and scheduling of repair resources (e.g., crews) to service affected nodes of large power grid networks. Traditional manual restoration methods are inadequate for modern smart grids sprawling acr
Externí odkaz:
http://arxiv.org/abs/2404.13422
We study the expressibility and learnability of convex optimization solution functions and their multi-layer architectural extension. The main results are: \emph{(1)} the class of solution functions of linear programming (LP) and quadratic programmin
Externí odkaz:
http://arxiv.org/abs/2212.01314
Autor:
Kaushik, Harshal D., Jin, Ming
We propose an implicit gradient based scheme for a constrained optimization problem with nonconvex loss function, which can be potentially used to analyze a variety of applications in machine learning, including meta-learning, hyperparameter optimiza
Externí odkaz:
http://arxiv.org/abs/2203.12653
We consider distributed optimization over networks where each agent is associated with a smooth and strongly convex local objective function. We assume that the agents only have access to unbiased estimators of the gradient of their objective functio
Externí odkaz:
http://arxiv.org/abs/2110.06575
We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application
Externí odkaz:
http://arxiv.org/abs/2105.14205
Autor:
Kaushik, Harshal D., Yousefian, Farzad
We consider a class of optimization problems with Cartesian variational inequality (CVI) constraints, where the objective function is convex and the CVI is associated with a monotone mapping and a convex Cartesian product set. This mathematical formu
Externí odkaz:
http://arxiv.org/abs/2007.15845
Autor:
Kaushik, Harshal D., Yousefian, Farzad
Motivated by applications arising from sensor networks and machine learning, we consider the problem of minimizing a finite sum of nondifferentiable convex functions where each component function is associated with an agent and a hard-to-project cons
Externí odkaz:
http://arxiv.org/abs/2006.07956
Publikováno v:
In IFAC PapersOnLine 2023 56(2):9336-9341
Autor:
Kaushik, Harshal, Yousefian, Farzad
Motivated by high-dimensional nonlinear optimization problems as well as ill-posed optimization problems arising in image processing, we consider a bilevel optimization model where we seek among the optimal solutions of the inner level problem, a sol
Externí odkaz:
http://arxiv.org/abs/1809.10035